How to use the Fibonacci Calculator
- Enter the position n (F(0) = 0, F(1) = 1).
- Read F(n) and its number of digits.
- Tick the option to list the sequence.
What does this tool do?
Each Fibonacci number is the sum of the two before it: 0, 1, 1, 2, 3, 5, 8, 13… The sequence appears in nature — in sunflower seed spirals, pine cones and branching patterns — and in computer science and finance.
The ratio of consecutive Fibonacci numbers gets closer and closer to the golden ratio φ ≈ 1.6180339887. Big values are calculated exactly with arbitrary-precision integers.
Why use it?
- Exact even for thousands of digits.
- Lists the sequence.
- Shows the golden-ratio link.
Use cases
- Maths homework and puzzles.
- Testing big-number and recursion code.
- Exploring the golden ratio and patterns in nature.
Fibonacci numbers grow fast
By the 100th term the number has 21 digits:
| n | F(n) |
|---|---|
| 10 | 55 |
| 20 | 6,765 |
| 50 | 12,586,269,025 |
| 100 | 354,224,848,179,261,915,075 |
Common mistakes
- Mixing up whether the sequence starts at F(0) = 0 or F(1) = 1.
- Calculating large terms with ordinary floating point, which loses digits after about F(78).
- Writing naive recursive code, which gets very slow for big n.
The formula
Privacy
The calculation happens instantly in your browser. The numbers you enter are not sent to our servers or saved. There's no account to create and nothing to install.
Frequently asked questions
Why does F(n+1) ÷ F(n) approach 1.618?
The ratio converges to the golden ratio φ as the numbers grow.
Is there a formula for F(n)?
Yes, Binet's formula: F(n) = (φⁿ − ψⁿ) ÷ √5, where ψ = 1 − φ.
Are the big results exact?
Yes, they use arbitrary-precision integers.
Content last updated . See how M2Toolkit works.