Definition

Definition

Let ANA \subseteq \mathbb{N} and SS be a set.

If f ⁣:ASf \colon A \to S is a function, then ff is a sequence.

Sequences may be finite or infinite, and their terms may be numbers or functions.

Notation

Let f ⁣:ASf \colon A \to S be a sequence.

It is common to choose some letter, usually ss, to represent the elements of this sequence.

For each kAk \in A, f(k)f(k) is denoted sks_k, and ff is denoted (sk)kA(s_k)_{k\in A}.

For example, the following is a sequence of Fibbonachi numbers,

(1,1,2,3,5,8,13,). \left(1,1,2,3,5,8,13,\dots\right).

We would denote the sequence (Fk)kN(F_k)_{k\in \mathbb{N}}, where F1=1F_1 = 1, F2=1F_2 = 1, F3=2F_3 = 2, ect.