阅读指南 [ 编辑 ] 基础知识 [ 编辑 ] 数列的定义与基本概念 [ 编辑 ] 按照一定的顺序排列的一列数叫做数列 （Sequence of number ），数列中的每个数叫做这个数列的一个项 （term ），数列中的每一个数都和它的序号有关，排在第1位的数称为这个数列的第1项（也叫做首项），排在第2位的数叫做数列的第2项……以此类推，排在第n位的数叫做这个数列的第n项 。所以，数列的一般形式可以写成：
a
1
,
a
2
,
a
3
,
⋯
,
a
n
,
⋯
{\displaystyle a_{1},a_{2},a_{3},\cdots ,a_{n},\cdots }
{
a
n
}
{\displaystyle \left\{a_{n}\right\}}
项目有限的数列叫做有穷数列 ，而项目无穷的数列则称之为无穷数列 。项目全部为正数的数列叫做正项数列 。
如果数列
{
a
n
}
{\displaystyle \left\{a_{n}\right\}}
一般项公式 （general term ）或通项公式 。我们可以通过这个公式计算出数列的各个项。
我们将
a
1
+
a
2
+
a
3
+
⋯
+
a
n
{\displaystyle a_{1}+a_{2}+a_{3}+\cdots +a_{n}}
{
a
n
}
{\displaystyle \{a_{n}\}}
S
n
{\displaystyle S_{n}}
S
n
=
a
1
+
a
2
+
⋯
+
a
n
{\displaystyle S_{n}=a_{1}+a_{2}+\cdots +a_{n}}
{
n
(
n
+
1
)
10
}
{\displaystyle \{{\frac {n(n+1)}{10}}\}}
{
a
n
}
{\displaystyle \{a_{n}\}}
a
n
=
n
2
−
n
+
1
{\displaystyle a_{n}=n^{2}-n+1}
a
n
=
n
(
n
−
1
)
2
{\displaystyle a_{n}={\frac {n(n-1)}{2}}}
a
n
=
n
(
n
+
1
)
2
{\displaystyle a_{n}={\frac {n(n+1)}{2}}}
a
n
=
n
(
n
+
2
)
2
{\displaystyle a_{n}={\frac {n(n+2)}{2}}}
a
n
=
1
n
+
1
n
+
1
+
1
n
+
2
+
1
n
+
3
+
.
.
.
+
1
n
2
(
n
∈
N
+
)
{\displaystyle a_{n}={\frac {1}{n}}+{\frac {1}{n+1}}+{\frac {1}{n+2}}+{\frac {1}{n+3}}+...+{\frac {1}{n^{2}}}\quad (n\in \mathbb {N} ^{+})}
a
2
=
{\displaystyle a_{2}=}
1
2
{\displaystyle {\frac {1}{2}}}
1
2
+
1
3
{\displaystyle {\frac {1}{2}}+{\frac {1}{3}}}
1
2
+
1
3
+
1
4
{\displaystyle {\frac {1}{2}}+{\frac {1}{3}}+{\frac {1}{4}}}
1
2
+
1
3
+
1
4
+
1
5
{\displaystyle {\frac {1}{2}}+{\frac {1}{3}}+{\frac {1}{4}}+{\frac {1}{5}}}
a
n
=
1
n
+
1
+
1
n
+
2
+
1
n
+
3
+
1
n
+
4
+
.
.
.
+
1
2
n
(
n
∈
N
+
)
{\displaystyle a_{n}={\frac {1}{n+1}}+{\frac {1}{n+2}}+{\frac {1}{n+3}}+{\frac {1}{n+4}}+...+{\frac {1}{2n}}\quad (n\in \mathbb {N} ^{+})}
a
n
+
1
−
a
n
=
{\displaystyle a_{n+1}-a_{n}=}
1
2
n
+
1
{\displaystyle {\frac {1}{2n+1}}}
1
2
n
+
2
{\displaystyle {\frac {1}{2n+2}}}
1
2
n
+
1
+
1
2
n
+
2
{\displaystyle {\frac {1}{2n+1}}+{\frac {1}{2n+2}}}
1
2
n
+
1
+
1
2
n
+
2
{\displaystyle {\frac {1}{2n+1}}+{\frac {1}{2n+2}}}
常见性质与分类 [ 编辑 ]
{
a
n
}
{\displaystyle \{a_{n}\}}
a
n
=
n
3
n
+
1
{\displaystyle a_{n}={\frac {n}{3n+1}}}
递推关系式及其简单使用 [ 编辑 ] 如果已知一个数列
{
a
n
}
{\displaystyle \{a_{n}\}}
递推关系式 （recurrence relation ），简称递推式 。以递推式描述的数列也叫做递推数列 ，它的每一项需要由给定的前几项以及递推关系式共同确定。
{
a
n
}
{\displaystyle \{a_{n}\}}
a
1
=
1
,
a
n
+
1
=
1
2
a
n
+
1
2
n
{\displaystyle a_{1}=1,a_{n+1}={\frac {1}{2}}a_{n}+{\frac {1}{2n}}}
{
a
n
}
{\displaystyle \{a_{n}\}}
a
1
=
2
,
a
2
=
5
,
a
n
+
1
=
a
n
+
2
+
a
n
(
n
≥
3
,
n
∈
N
)
{\displaystyle a_{1}=2,a_{2}=5,a_{n+1}=a_{n+2}+a_{n}\quad (n\geq 3,n\in \mathbb {N} )}
{
a
n
}
{\displaystyle \{a_{n}\}}
a
1
=
1
,
a
n
+
a
n
+
1
=
2
(
n
∈
N
+
)
{\displaystyle a_{1}=1,a_{n}+a_{n+1}=2\quad (n\in \mathbb {N} ^{+})}
{
a
n
}
{\displaystyle \{a_{n}\}}
a
1
=
1
,
a
n
=
n
(
a
n
+
1
−
a
n
)
(
n
∈
N
+
)
{\displaystyle a_{1}=1,a_{n}=n(a_{n+1}-a_{n})\quad (n\in \mathbb {N} ^{+})}
{
a
n
}
{\displaystyle \{a_{n}\}}
a
1
=
2
,
a
n
+
1
−
a
n
=
a
n
−
a
n
+
1
a
n
2
a
n
+
1
2
(
n
∈
N
+
)
{\displaystyle a_{1}=2,a_{n+1}-a_{n}={\frac {a_{n}-a_{n+1}}{a_{n}^{2}a_{n+1}^{2}}}\quad (n\in \mathbb {N} ^{+})}
具有分式形式的递推式有比较复杂的求解方法。但是有一类分式形式的递推式实际上等价于很容易求解的周期数列，因此经常会出现在不需要给出详细过程的选择题或填空题中。
{
a
n
}
{\displaystyle \{a_{n}\}}
a
8
=
2
,
a
n
+
1
=
1
1
−
a
n
(
n
∈
N
+
)
{\displaystyle a_{8}=2,a_{n+1}={\frac {1}{1-a_{n}}}\quad (n\in \mathbb {N} ^{+})}
{
a
n
}
{\displaystyle \{a_{n}\}}
a
1
=
1
,
a
n
+
1
=
a
n
2
a
n
+
1
(
n
∈
N
+
)
{\displaystyle a_{1}=1,a_{n+1}={\frac {a_{n}}{2a_{n}+1}}\quad (n\in \mathbb {N} ^{+})}
{
a
n
}
{\displaystyle \{a_{n}\}}
a
1
=
0
,
a
n
+
1
=
a
n
−
3
3
a
n
+
1
(
n
∈
N
+
)
{\displaystyle a_{1}=0,a_{n+1}={\frac {a_{n}-{\sqrt {3}}}{{\sqrt {3}}a_{n}+1}}\quad (n\in \mathbb {N} ^{+})}
a
2018
{\displaystyle a_{2018}}
与集合、函数的关系 [ 编辑 ] 图2-1-1 数列是一种自变量只取整数的离散化函数。 数列可以看成以正整数集
N
+
{\displaystyle \mathbb {N} ^{+}}
a
n
=
f
(
n
)
{\displaystyle a_{n}=f(n)}
y
=
f
(
x
)
{\displaystyle y=f(x)}
f
(
i
)
(
i
=
1
,
2
,
3
,
⋯
)
{\displaystyle f(i)\quad (i=1,2,3,\cdots )}
f
(
1
)
,
f
(
2
)
,
f
(
3
)
,
⋯
,
f
(
n
)
⋯
{\displaystyle f(1),f(2),f(3),\cdots ,f(n)\cdots }
常用结论与常见模型 [ 编辑 ] 根据规律猜想通项公式 [ 编辑 ]
2
3
,
4
5
,
6
7
,
8
9
,
.
.
.
{\displaystyle {\frac {2}{3}},{\frac {4}{5}},{\frac {6}{7}},{\frac {8}{9}},...}
16
17
{\displaystyle {\frac {16}{17}}}
18
19
{\displaystyle {\frac {18}{19}}}
20
21
{\displaystyle {\frac {20}{21}}}
22
23
{\displaystyle {\frac {22}{23}}}
0
,
1
4
,
1
3
,
3
8
,
.
.
.
,
n
−
1
2
n
,
.
.
.
{\displaystyle 0,{\frac {1}{4}},{\frac {1}{3}},{\frac {3}{8}},...,{\frac {n-1}{2n}},...}
3
7
{\displaystyle {\frac {3}{7}}}
1
2
,
3
4
,
5
6
,
7
8
,
.
.
.
{\displaystyle {\frac {1}{2}},{\frac {3}{4}},{\frac {5}{6}},{\frac {7}{8}},...}
2
,
5
,
2
2
,
11
,
.
.
.
{\displaystyle {\sqrt {2}},{\sqrt {5}},2{\sqrt {2}},{\sqrt {11}},...}
递推式的简单寻找 [ 编辑 ]
{
a
n
}
{\displaystyle \{a_{n}\}}
a
n
=
{
1
(
n
=
1
)
a
n
+
1
+
n
−
1
(
n
≥
2
,
n
∈
N
)
{\displaystyle a_{n}=\left\{{\begin{array}{l}1\quad (n=1)\\a_{n+1}+n-1\quad (n\geq 2,n\in \mathbb {N} )\end{array}}\right.}
a
n
=
{
1
(
n
=
1
)
a
n
−
1
+
n
(
n
≥
2
,
n
∈
N
)
{\displaystyle a_{n}=\left\{{\begin{array}{l}1\quad (n=1)\\a_{n-1}+n\quad (n\geq 2,n\in \mathbb {N} )\end{array}}\right.}
a
n
=
{
1
(
n
=
1
)
a
n
−
1
+
n
−
1
(
n
≥
2
,
n
∈
N
)
{\displaystyle a_{n}=\left\{{\begin{array}{l}1\quad (n=1)\\a_{n-1}+n-1\quad (n\geq 2,n\in \mathbb {N} )\end{array}}\right.}
a
n
=
{
1
(
n
=
1
)
a
n
+
1
+
n
+
1
(
n
≥
2
,
n
∈
N
)
{\displaystyle a_{n}=\left\{{\begin{array}{l}1\quad (n=1)\\a_{n+1}+n+1\quad (n\geq 2,n\in \mathbb {N} )\end{array}}\right.}
a
n
{\displaystyle a_{n}}
a
n
−
1
(
n
≥
2
)
{\displaystyle a_{n-1}\quad (n\geq 2)}
1
,
1
2
,
1
3
,
1
4
,
1
5
,
1
6
,
.
.
.
{\displaystyle 1,{\frac {1}{2}},{\frac {1}{3}},{\frac {1}{4}},{\frac {1}{5}},{\frac {1}{6}},...}
{
a
n
}
{\displaystyle \{a_{n}\}}
a
n
{\displaystyle a_{n}}
a
n
+
1
{\displaystyle a_{n+1}}
补充习题 [ 编辑 ]
(1)
1
2
,
3
4
,
7
8
,
15
16
,
31
32
,
.
.
.
{\displaystyle {\frac {1}{2}},{\frac {3}{4}},{\frac {7}{8}},{\frac {15}{16}},{\frac {31}{32}},...}
(2)
−
1
,
8
5
,
−
15
7
,
24
9
,
.
.
.
{\displaystyle -1,{\frac {8}{5}},-{\frac {15}{7}},{\frac {24}{9}},...}
参考资料 [ 编辑 ]
外部链接 [ 编辑 ] 
相关例题1：
下列哪个数是数列中的一项？( )
