Sequences are often denoted by brackets like${\displaystyle \left\{2,3,3,4,4\right\}}$. Furthermore if we have a sequence${\displaystyle a}$ such that${\displaystyle a=\left\{1,2,3,4,5\right\}}$ then${\displaystyle a_1=1,a_2=2,a_3=\mathrm{3...}}$. The subscript must be a non-negative integer. Also notice that${\displaystyle n}$ starts from one and counts up.

We can describe the terms in this sequence with a formula${\displaystyle a_n=n}$ for all non-negative integers. So under this definition${\displaystyle a_6}$ is not defined, and indeed${\displaystyle a_6}$ is not in the sequence.

Infinite sequences have infinite terms. For such a sequence, we can again give a formula for any term in the sequence. For our previous sequence${\displaystyle a}$, we can say${\displaystyle a_n=n}$ for all non-negative integers${\displaystyle n}$. This sequence could also be denoted as${\displaystyle \left\{0,1,2,3,4,5,...\right\}}$ where the period of ellipses implies that this sequence is infinite.

Earlier, we defined the members of the infinite sequence${\displaystyle a}$ as${\displaystyle a_n=n}$ for all non-negative integers${\displaystyle n}$. This is known as adiscrete function,discrete definition, orexplicit definition. A discrete function is any function whose domain is not the set of all real or imaginary numbers, but is instead a smaller, countable set like the set of all integers or the set of all rational numbers. Note that a set differs from a sequence, but that is beyond the scope of this discussion.

Discrete functions only take “countable”, discrete domains. The set of all integers is countable, because there are not infinitely many values between two values in the set; there is no extra value between 2 and 1, as 1.5 is not an integer and is not contained in the set. Also note that given a discrete function or explicit definition, as long as the domain is discrete, the range must also be discrete. This means that if the input of a discrete function is countable, the output must also be countable.

${\displaystyle q_n=n+1}$

${\displaystyle q=\left\{2,3,4,5,\mathrm{6...}\right\}}$

This is known as an arithmetic sequence. These will be discussed later.

${\displaystyle c_n=\cos (n-1)}$

${\displaystyle c=\left\{1,\mathrm{0.5403...},-\mathrm{0.4161...},-\mathrm{0.9899...},\mathrm{0.2836...},...\right\}}$

This result may be interesting: a sequence does not need to be a collection of integers, indeed it can be any collection, as long as it is countable. Here, we are simply taking the cosine of all integers, and any discrete function must have both a discrete domainand range.

Recursive functions,recursive formulas, orrecursive definitions are formulas in which${\displaystyle a_n}$ is defined in terms of${\displaystyle a_{n-1}}$. Knowing any term in a recursively defined sequence requires you to know all the terms before it, which means you must know the first term, sometimes denoted${\displaystyle a_0}$ or${\displaystyle a_1}$. The first term must be defined in order to have a proper recursive sequence; it cannot be assumed that the first term is 1.

Sometimes, one can have a sequence that isnecessarily defined by a recursive function. For instance, the recursively defined sequence${\displaystyle u_{n+1}=\cos (u_n),a_1=1}$. This sequence cannot be expressed any other "easy" way and in this kind of situation it is best to use the recursive definition.

The sequence

${\displaystyle p_{n+1}=p_n+1,p_1=2}$

${\displaystyle p=\left\{2,3,4,\mathrm{5...}\right\}}$

is the same arithmetic sequence mentioned earlier. However, this time it uses a recursive definition which is essentially the same.

This is the sequence of cosine mentioned earlier:

${\displaystyle u_{n+1}=\cos (u_n),a_1=1}$

${\displaystyle u=\left\{\mathrm{0.5403...},-\mathrm{0.9111...},\mathrm{0.6128...},\mathrm{0.8180...},...\right\}}$

${\displaystyle s_n=3\times s_{n-1}}$

Notice that this time, instead of saying${\displaystyle s_{n+1}=...}$, we defined${\displaystyle s_n}$ in terms of${\displaystyle s_{n-1}}$. This definition is still valid.

• Book:Calculus