The Fibonacci Sequence (Jump to: Lecture | Video )

Below are three examples of sequences:

-2, 5, 8, 15, 20

-21, -18, -7, 7, 8

1, 2, 3, 5, 7, 9, 10

Below is the beginning of the Fiboacci Sequence:

1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89…

Figure 1.

Above, you can see how each new term comes from the sum of the two previous terms.

The Fibonacci Sequence is an example of a recursive formula.