Algebra
Fibonacci Sequence: Formula, List, Golden Ratio And Uses
Last updated: October 2026
The Fibonacci sequence is a series of numbers where each number is the sum of the two before it. It starts 0, 1, 1, 2, 3, 5, 8, 13, 21, 34. The rule is Fₙ = Fₙ₋₁ + Fₙ₋₂. As the numbers grow, the ratio between neighbors gets closer to the golden ratio, about 1.618.
Below are the rule, the first 30 terms, a formula for any term, the history, and the facts and myths about Fibonacci in nature.
What Is The Fibonacci Sequence?
The Fibonacci sequence is a pattern of whole numbers built by adding. You start with 0 and 1, and every new number is the sum of the previous two.
Here is how the first few terms are built:
| Term | Calculation | Value |
|---|---|---|
| F₀ | Starting value | 0 |
| F₁ | Starting value | 1 |
| F₂ | 0 + 1 | 1 |
| F₃ | 1 + 1 | 2 |
| F₄ | 1 + 2 | 3 |
| F₅ | 2 + 3 | 5 |
| F₆ | 3 + 5 | 8 |
| F₇ | 5 + 8 | 13 |
| F₈ | 8 + 13 | 21 |
Each number in the sequence is called a Fibonacci number. The sequence never ends, and the numbers grow quickly. By the 30th term, you are already past 800,000.
Does It Start With 0 Or 1?
Both versions are common, and both are correct. Modern math usually starts with F₀ = 0 and F₁ = 1. Many older books and some school textbooks start with 1, 1, 2, 3, 5.
The only difference is whether 0 appears at the front. Every number after that is the same. When you read a problem, check which starting point it uses, because it changes what "the 10th Fibonacci number" means.
Fibonacci Sequence Vs Fibonacci Series
A sequence is a list of numbers. A series is what you get when you add the numbers in a list. So 0, 1, 1, 2, 3, 5 is the Fibonacci sequence, and 0 + 1 + 1 + 2 + 3 + 5 = 12 is a Fibonacci series.
In everyday use, many people say "Fibonacci series" when they mean the list.
The Fibonacci Sequence Formula
The Fibonacci sequence has two formulas. The recursive rule builds each term from the ones before it, and Binet's formula jumps straight to any term without listing the others.
The Recursive Rule
The standard rule is:
Fₙ = Fₙ₋₁ + Fₙ₋₂, with F₀ = 0 and F₁ = 1
In words: the nth term equals the term before it plus the term two places before it.
Example: find F₁₂
You need F₁₀ = 55 and F₁₁ = 89.
F₁₂ = 89 + 55 = 144
This rule is easy but slow for large terms, since F₅₀ needs all 49 terms before it.
Binet's Formula
Binet's formula gives any Fibonacci number directly:
Fₙ = (φⁿ – ψⁿ) / √5
- φ (phi) = (1 + √5) / 2 ≈ 1.6180339887, the golden ratio
- ψ (psi) = (1 – √5) / 2 ≈ -0.6180339887
Because ψⁿ shrinks toward 0 very fast, there is a simpler shortcut for real use:
Fₙ ≈ φⁿ / √5, rounded to the nearest whole number
Example: find F₂₀
- φ²⁰ ≈ 15,126.9999
- √5 ≈ 2.2361
- 15,126.9999 ÷ 2.2361 ≈ 6,765.00003
- Round: F₂₀ = 6,765
You can work out the power with an exponent calculator and get √5 from a square root calculator. A rounding calculator handles the last step if you are unsure.
The formula is named after French mathematician Jacques Philippe Marie Binet, though Abraham de Moivre and Daniel Bernoulli already knew it.
List Of The First 30 Fibonacci Numbers
These are the first 30 terms after F₀ = 0, so you can look up any value quickly.
| n | Fₙ | n | Fₙ | n | Fₙ |
|---|---|---|---|---|---|
| 1 | 1 | 11 | 89 | 21 | 10,946 |
| 2 | 1 | 12 | 144 | 22 | 17,711 |
| 3 | 2 | 13 | 233 | 23 | 28,657 |
| 4 | 3 | 14 | 377 | 24 | 46,368 |
| 5 | 5 | 15 | 610 | 25 | 75,025 |
| 6 | 8 | 16 | 987 | 26 | 121,393 |
| 7 | 13 | 17 | 1,597 | 27 | 196,418 |
| 8 | 21 | 18 | 2,584 | 28 | 317,811 |
| 9 | 34 | 19 | 4,181 | 29 | 514,229 |
| 10 | 55 | 20 | 6,765 | 30 | 832,040 |
For a sense of how fast the numbers grow, F₅₀ is 12,586,269,025. That is more than 12 billion, and only 50 steps in.
How The Fibonacci Sequence Connects To The Golden Ratio
If you divide any Fibonacci number by the one before it, the answer gets closer and closer to the golden ratio, φ ≈ 1.618. The bigger the numbers, the closer you get.
| Ratio | Result |
|---|---|
| 3 ÷ 2 | 1.5 |
| 5 ÷ 3 | 1.6667 |
| 8 ÷ 5 | 1.6 |
| 13 ÷ 8 | 1.625 |
| 21 ÷ 13 | 1.6154 |
| 34 ÷ 21 | 1.6190 |
| 55 ÷ 34 | 1.6176 |
| 89 ÷ 55 | 1.6182 |
| 144 ÷ 89 | 1.6180 |
Notice how the ratios bounce above and below 1.618, closing in each time. By 144 ÷ 89, the answer already matches φ to four decimal places.
The golden ratio is the number where a line split into a long part and a short part has this property: the whole line divided by the long part equals the long part divided by the short part. Its exact value is (1 + √5) / 2. It is irrational, so its decimal never ends or repeats.
The Fibonacci Spiral
The Fibonacci spiral is a curve drawn through squares whose side lengths are Fibonacci numbers.
- Draw two 1 × 1 squares side by side.
- Add a 2 × 2 square along their long edge.
- Add a 3 × 3 square, then 5 × 5, then 8 × 8, each along the longest edge so far.
- Draw a quarter circle across each square, corner to corner, connecting them.
The result is a spiral that grows by about 1.618 times every quarter turn, matching the golden spiral closely. The rectangle that holds all the squares gets closer to a golden rectangle as you add more.
Who Discovered The Fibonacci Sequence?
The sequence is named after Leonardo of Pisa, known as Fibonacci, who introduced it to Western Europe in his 1202 book Liber Abaci. But Indian mathematicians described the same numbers centuries earlier.
Indian Mathematicians Found It First
The numbers first appear in Indian mathematics. As early as about 200 BC, the scholar Pingala studied the sequence while counting the possible rhythm patterns in Sanskrit poetry built from short and long syllables.
Later scholars wrote it down more clearly. Virahanka (around 700 AD) explained how each count is the sum of the two before it, and Hemachandra (around 1150) gave the same rule. Their question was poetic: how many ways can you fill a line of a given length with one-beat and two-beat syllables? The answer, for each length, is a Fibonacci number.
Fibonacci's Rabbit Puzzle
Fibonacci used the numbers in a puzzle about rabbits in Liber Abaci. The same book also helped bring Hindu-Arabic numerals (0 to 9) into wide use in Europe.
The puzzle goes like this:
- Start with one pair of baby rabbits in a field.
- A pair becomes able to breed after one month.
- Each month after that, every adult pair produces one new pair.
- No rabbits die.
| Month | Adult pairs | Baby pairs | Total pairs |
|---|---|---|---|
| 1 | 0 | 1 | 1 |
| 2 | 1 | 0 | 1 |
| 3 | 1 | 1 | 2 |
| 4 | 2 | 1 | 3 |
| 5 | 3 | 2 | 5 |
| 6 | 5 | 3 | 8 |
The totals follow the Fibonacci sequence. After 12 months, there are 144 pairs. Real rabbits do not breed this neatly, of course. The puzzle is a math exercise, not a biology lesson.
Patterns Hidden In The Fibonacci Sequence
The Fibonacci sequence is full of patterns that repeat forever. These are some of the easiest to check with the list above.
| Pattern | Example |
|---|---|
| Every 3rd Fibonacci number is even | F₃ = 2, F₆ = 8, F₉ = 34, F₁₂ = 144 |
| Every 4th Fibonacci number is divisible by 3 | F₄ = 3, F₈ = 21, F₁₂ = 144 |
| Every 5th Fibonacci number is divisible by 5 | F₅ = 5, F₁₀ = 55, F₁₅ = 610 |
| The sum of the first n terms is Fₙ₊₂ – 1 | 1 + 1 + 2 + 3 + 5 + 8 + 13 + 21 + 34 + 55 = 143 = F₁₂ – 1 |
| The sum of the squares is the product of two neighbors | 1² + 1² + 2² + 3² + 5² + 8² + 13² + 21² = 714 = 21 × 34 |
| Neighbors share no common factor | 21 and 34 have no factor in common except 1 |
| Cassini's identity: Fₙ₋₁ × Fₙ₊₁ – Fₙ² = ±1 | 34 × 89 – 55² = 3,026 – 3,025 = 1 |
One more curious fact: 1 ÷ 89 = 0.011235955… The first digits are 0, 1, 1, 2, 3, 5, which come from the Fibonacci numbers overlapping as they add up in the decimal places.
Fibonacci Numbers Before Zero
The sequence can also run backward. Use the rule in reverse: Fₙ₋₂ = Fₙ – Fₙ₋₁.
Going backward from 0 gives: …, -8, 5, -3, 2, -1, 1, 0, 1, 1, 2, 3, 5, 8, …
The numbers are the same as the regular sequence, but every second one is negative. This extended version is sometimes called the negafibonacci sequence.
Lucas Numbers: A Close Cousin
Lucas numbers follow the same adding rule but start with 2 and 1 instead of 0 and 1: 2, 1, 3, 4, 7, 11, 18, 29, 47, 76 and so on.
The ratio of neighboring Lucas numbers also approaches the golden ratio. This shows that the golden ratio comes from the adding rule itself, not from the starting values.
The Fibonacci Sequence In Nature
Fibonacci numbers really do appear in many plants and in the family trees of honeybees. But some popular examples are exaggerated, so it helps to know which ones hold up.
Where It Really Shows Up
- Sunflower heads. The seeds form two sets of spirals, one turning left and one turning right. The number of spirals in each direction is often a pair of neighboring Fibonacci numbers, such as 34 and 55.
- Pinecones and pineapples. The scales and fruitlets form spirals whose counts are often Fibonacci numbers, such as 8 and 13.
- Leaf arrangement. On many stems, each new leaf grows at about 137.5° from the last, the "golden angle." This spacing helps leaves avoid shading each other.
- Flower petals. Many flowers have 3, 5, 8, 13 or 21 petals. Field daisies most often have a Fibonacci number of petals.
- Honeybee family trees. A male bee has one parent (a mother), while a female has two. Counting a male bee's ancestors back through each generation gives 1, 1, 2, 3, 5, 8.
Myths To Watch Out For
The Fibonacci sequence is often stretched to explain things it does not.
- Nautilus shells. These are spirals, but careful measurements show they do not follow the golden ratio. They grow by a different, smaller ratio.
- "Every flower has Fibonacci petals." Many do, but plenty do not. Plants with 4 or 6 petals are common too.
- Famous art and buildings. Claims that the Parthenon or the Mona Lisa were built on the golden ratio are hard to prove. You can draw golden rectangles over almost any image if you choose the starting points carefully.
The honest summary: Fibonacci patterns are common in plant growth because of how new cells and seeds pack together, but they are a tendency, not a law of nature.
Real-World Uses Of Fibonacci Numbers
Outside nature, Fibonacci numbers show up in computer science, project planning and even quick unit conversions.
| Field | How Fibonacci numbers are used |
|---|---|
| Computer science | Fibonacci search and the Fibonacci heap data structure; also a classic first example for teaching recursion |
| Project management | Many agile teams estimate task size with a modified Fibonacci scale like 1, 2, 3, 5, 8, 13 |
| Design and photography | Golden ratio grids and spirals as a guide for layout and cropping |
| Finance | "Fibonacci retracement" lines used by some traders in technical analysis |
Fibonacci retracement is a charting habit, not a proven way to predict prices. This is not financial advice. Talk to a licensed professional before making investment decisions.
The Miles To Kilometers Trick
Because 1 mile is about 1.609 kilometers, which is close to the golden ratio, neighboring Fibonacci numbers make a quick conversion table.
| Miles | Kilometers (Fibonacci) | Exact km |
|---|---|---|
| 3 | 5 | 4.83 |
| 5 | 8 | 8.05 |
| 8 | 13 | 12.87 |
| 13 | 21 | 20.92 |
| 21 | 34 | 33.80 |
So a 5-mile run is about 8 km. For an exact answer, the unit converter gives the precise value.
How To Find The Fibonacci Number You Need
The right method depends on how big the term is and what tools you have. This table helps you choose.
| Goal | Best method | Example |
|---|---|---|
| Small terms (up to about F₂₀) | Add neighbors by hand | F₁₂ = 89 + 55 = 144 |
| A single large term | Binet's shortcut, rounded | F₂₀ ≈ φ²⁰ / √5 = 6,765 |
| Check if a number is Fibonacci | Test whether 5n² + 4 or 5n² – 4 is a perfect square | For 21: 5(441) – 4 = 2,201 is not square, but 5(441) + 4 = 2,209 = 47², so yes |
| Very large terms | Computer code using loops, not plain recursion | F₁₀₀ has 21 digits |
A scientific calculator handles Binet's formula well for terms that fit on its screen, usually up to about F₄₅. Past that, it rounds and the last digits are lost.
Common Mistakes To Avoid
Most Fibonacci mistakes come from mixing up starting points or the index of a term.
| Mistake | Fix |
|---|---|
| Mixing up whether the list starts at 0 or 1 | Check which version the problem uses before counting |
| Adding the wrong neighbors | Each term is the sum of the two directly before it, not any two terms |
| Treating Binet's shortcut as exact for small n | Always round φⁿ / √5 to the nearest whole number |
| Thinking every spiral in nature is Fibonacci | Treat nature examples as common patterns, not rules |
| Calling the golden ratio exactly 1.618 | It is irrational; 1.618 is a rounded value |
Summary
The Fibonacci sequence starts 0, 1, 1, 2, 3, 5, 8, and each term is the sum of the two before it. Binet's formula, Fₙ ≈ φⁿ / √5 rounded, finds any term directly. The ratio of neighbors approaches the golden ratio, about 1.618.
Indian scholars described the numbers as early as 200 BC, and Fibonacci brought them to Europe in 1202. They appear often in plant growth and bee family trees, but many popular claims about shells and art are myths.
Next step: try extending the table to F₄₀ by hand, then check your answer for F₄₀ (102,334,155) with Binet's shortcut.
Frequently Asked Questions
What are the first 20 Fibonacci numbers?
Starting from 0, the first 20 Fibonacci numbers are 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987, 1,597, 2,584 and 4,181. If your textbook starts the sequence at 1 instead of 0, add 6,765 at the end and drop the 0. Each number is found by adding the two numbers just before it.
Why is the Fibonacci sequence so important?
The Fibonacci sequence matters because a very simple rule produces deep patterns. It links whole numbers to the golden ratio, appears in plant growth, and shows up across many areas of math, including number theory and combinatorics. It is also one of the first examples used to teach recursion in computer programming. There is even a math journal, the Fibonacci Quarterly, devoted to studying it.
What is the 100th Fibonacci number?
The 100th Fibonacci number, F₁₀₀, is 354,224,848,179,261,915,075. It has 21 digits. Most handheld calculators cannot show it exactly because they round after about 10 to 15 digits. Computer programs that add the terms one by one with whole-number math can find it exactly in a fraction of a second, far faster than by hand.
Is 0 a Fibonacci number?
Yes, in the modern version of the sequence, 0 is the first Fibonacci number, written F₀ = 0. Starting with 0 makes several formulas cleaner, including Binet's formula and many divisibility rules. Some older sources start at 1, 1 instead, so they leave 0 out. Both versions produce the same numbers from 1 onward.
What is Fibonacci Day?
Fibonacci Day is celebrated on November 23 each year, because the date written in US format, 11/23, shows the first four Fibonacci numbers after 0: 1, 1, 2, 3. Teachers often use the day for activities such as counting pinecone spirals, building Fibonacci spirals with squares, or solving the rabbit puzzle.
Is the Fibonacci sequence arithmetic or geometric?
No, it is neither. An arithmetic sequence adds the same amount each time, and a geometric sequence multiplies by the same amount. The Fibonacci sequence adds a changing amount: the term before. It is called a recursive sequence. For large terms it behaves almost like a geometric sequence, since each term is about 1.618 times the last.
Try it with your own numbers
Use a free CalcSolver tool to check the examples in this guide.