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 

Fn = Fn-2 + Fn-1 with F1 = 1 and F2 = 1

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

F1 = 1

F2 = 1

F3 = F1 + F2 = 1 + 1 = 2

F4 = F2 + F3 = 1 + 2 = 3

F5 = F3 + F4 = 2 + 3 = 5

F6 = F4 + F5 = 3 + 5 = 8

F7 = F5 + F6 = 5 + 8 = 13

F8 = F6 + F7 = 8 + 13 = 21

Homepage

Math words beginning with the letter f

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

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

  1. Click on the HTML link code below.
  2. 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.
Share this page: