The Fibonacci Sequence (Jump to: Lecture | Video )

Sequence

A Sequence is an ordered list of numbers.

Below are three examples of sequences:

-2, 5, 8, 15, 20

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

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

The Fibonacci Sequence

The Fibonacci Sequence is an ordered list of numbers where each new term is the sum of the two previous terms.

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.

Recursive Formula

In a recursive formula, each new term is formulated from one or more previous terms.


Back to Top