Definition
Sequences may be finite or infinite, and their terms may be numbers or functions.
For example, the following is a sequence of Fibbonachi numbers,
We would denote the sequence , where , , , ect.
Let A⊆N and S be a set.
If f:A→S is a function, then f is a sequence.
Sequences may be finite or infinite, and their terms may be numbers or functions.
Let f:A→S be a sequence.
It is common to choose some letter, usually s, to represent the elements of this sequence.
For each k∈A, f(k) is denoted sk, and f is denoted (sk)k∈A.
For example, the following is a sequence of Fibbonachi numbers,
(1,1,2,3,5,8,13,…).
We would denote the sequence (Fk)k∈N, where F1=1, F2=1, F3=2, ect.