# What is the Fibonacci sequence? Definition and Example

The Fibonacci sequence is a famous sequence that was introduced to the world by Leonardo Fibonacci.

The first 8 terms of the Fibonacci sequence are 1, 1, 2, 3, 5, 8, 13, 21.

The first two terms are 1 and 1. Then every term after that is found by adding the two preceding terms.

The recursive formula for the Fibonacci sequence is

F_{n} = F_{n-2} + F_{n-1} with F_{1} = 1 and F_{2} = 1

## How to Use the Recursive Formula to Find the First 8 Terms

F_{1} = 1

F_{2} = 1

F_{3} = F_{1} + F_{2} = 1 + 1 = 2

F_{4} = F_{2} + F_{3} = 1 + 2 = 3

F_{5} = F_{3} + F_{4} = 2 + 3 = 5

F_{6} = F_{4} + F_{5} = 3 + 5 = 8

F_{7} = F_{5} + F_{6} = 5 + 8 = 13

F_{8} = F_{6} + F_{7} = 8 + 13 = 21

## Enjoy this page? Please pay it forward. Here's how...

Would you prefer to share this page with others by linking to it?

- Click on the HTML link code below.
- Copy and paste it, adding a note of your own, into your blog, a Web page, forums, a blog comment, your Facebook account, or anywhere that someone would find this page valuable.