Through life you familiarized yourself with different kinds of simple sequences. You usually knew at first sight how is that sequence made and how to continue one. Now you will get to know a lot more different mathematical sequences and be able to do many operations with them.

Every sequence of numbers can be infinite and finite. As the same name says, infinite sequence of numbers has infinitely many members, and finite has finitely many members.

Before jumping to examples and tasks we should define what sequences are.

*Function defined on the set of real numbers is an infinite sequence *,

Finite sequences are simply functions that are given only on a particular part of the natural numbers.

*If **, where is a natural number, then *, is the finite sequence.

Simplified, sequence of real numbers is a function that takes every natural number and appends it a real number. If we have a given function , we usually write it in a following way:

or

Here is called **leading member** of the sequence, and is called **nth or general member** of the sequence.

## Making sequences

The key point in making sequences is knowing the function or a formula that it is given with. Usually that formula is given so that general member is expressed by some ordinal number .

**Example 1.** If general member is given with the formula write first four members of this sequence.

If we want to know what is the value of , we should simply insert instead of , and in the same way we could get any other member of this sequence.

-6, -2, 1, 6

Of course, sequences can be given using many different formulas but as long as their general member is given you can find any member by simply inserting the ordinal number of that member you want to find.

**Example 2.** Find And member of the sequence that is given by its general member

These aren’t that hard. But what happens if we can’t find every member with just inserting its ordinal number? This is where things with sequences get interesting. If we define one member of the sequence using one or more previous members, we say that we defined them using recursive formula or recursion.

*Recursive formula or a** recursion** is a formula in which the general member of the sequence is defined by using previous members.*

**Example 3.** Let’s say we have a sequence that is given with , where . Calculate first four members.

In recursions, first few members (as much as the recursion requires) has to be given in the task. Otherwise we could not even start calculating.

The first step is to calculate and then, using calculating other two members.

15, 18, 21, 24

**Example 4.** If , , write first seven members of this sequences.

This is called the **Fibonacci sequence**.