In the Fibonacci sequence each number is the sum of the two before it: 0, 1, 1, 2, 3, 5, 8, 13, … It appears in sunflower spirals, pine cones, rabbit populations, the Fibonacci heap data structure and trading “retracements”. The ratio of consecutive terms approaches the golden ratio φ.
How to use the Fibonacci Calculator
- n
- F₀
- F₁
Everything is calculated in your browser, so results appear instantly and nothing you type is sent to a server.
How it works
The calculator adds terms with exact whole-number arithmetic, so even F₁₀₀₀ (209 digits) is shown in full. Change F₀ and F₁ to get related sequences such as the Lucas numbers (2, 1, 3, 4, 7, …).
Formula
Fₙ = Fₙ₋₁ + Fₙ₋₂, F₀ = 0, F₁ = 1
Binet: Fₙ = (φⁿ − ψⁿ)/√5, φ = (1 + √5)/2
Worked example
Inputs: n: 100; F₀: 0; F₁: 1.
Results: Fₙ = 354,224,848,179,261,915,075; Number of digits = 21; Fₙ / Fₙ₋₁ = 1.61803398875 (φ ≈ 1.618033988749895); First terms = 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, ….
Key terms
- Golden ratio
- φ = (1 + √5)/2 ≈ 1.618.
Frequently asked questions
What is the 100th Fibonacci number?
354,224,848,179,261,915,075.
What are Lucas numbers?
The sequence with F₀ = 2, F₁ = 1: 2, 1, 3, 4, 7, 11, …
Why does the ratio approach 1.618?
It converges to the golden ratio φ.
Is 0 a Fibonacci number?
Yes, F₀ = 0 in the modern convention.