Fibonacci Number Calculator

Enter a non-negative index to get the exact term without scientific notation or rounding.

Index n

F100

3542248481 7926191507 5

Digits in the result: 21

Neighbouring terms

F99: 2189229958 3455516902 6

F101: 5731478440 1381708410 1

How the Fibonacci calculator works

A sequence of growing tiles arranged by the Fibonacci rule

The calculator treats the sequence as F0=0F_0=0 and F1=1F_1=1, then returns the exact term for your index together with its neighbours.

Enter a position, not a target value

The input is the index n. For example, n = 10 asks for the term at position 10 and produces 55. It does not search for where the number 10 appears.

Fn=Fn−1+Fn−2F_n=F_{n-1}+F_{n-2}

For small indices you can follow the recurrence by hand. For large ones the page uses fast doubling, which repeatedly halves the index and keeps every operation in integer arithmetic.

Indices from 0 through 40,000 are accepted. The visible number is grouped for reading, while the copy button preserves the digits without spaces.

Three ways to check the result

Index 10. The terms around it are 34, 55, and 89. Since 34 + 55 = 89, the neighbour panel confirms the recurrence.

Index 20. The answer is 6,765. A staircase with 19 steps that allows moves of one or two steps has the same number of routes, because each final move comes from one of two earlier states.

Index 100. The exact value is 354,224,848,179,261,915,075. It has 21 digits, so ordinary floating-point arithmetic cannot safely retain every digit.

Indexing and rounding cause most disagreements

Some books print the sequence as 1, 1, 2, 3, 5 and call the first 1 the first term. This calculator follows the common zero-based convention, so always compare an answer labelled Fₙ rather than relying on the phrase “the tenth number”.

The ratio of consecutive positive terms approaches the golden ratio, but it is only a limit. Binet's formula is useful for estimates; finite floating-point precision can spoil the last digits of a large exact result.

F₄₀₀₀₀ has 8,360 digits. The limit protects the page from impractically large rendering and copying, not from a weakness in the recurrence.

Questions about Fibonacci numbers

These answers clarify the numbering and the boundaries of this exact-integer tool.

What are F₀ and F₁?

This calculator uses F₀ = 0 and F₁ = 1, so the sequence starts 0, 1, 1, 2, 3, 5.

Why are neighbouring terms shown?

They let you verify that the previous term plus the selected term equals the next one.

Can I enter a negative index?

No. The interface covers the standard non-negative sequence from 0 to 40,000.

Is the large result rounded?

No. Fast doubling and BigInt keep the result as an exact integer.

Why stop at 40,000?

The result already contains 8,360 digits, so a higher limit would mainly make displaying and copying the answer less practical.

Similar calculators

You may find the following calculators on the same topic useful:

Share on social media

If you liked it, please share the calculator on your social media platforms. It`s easy for you and beneficial for the project`s promotion. Thank you!

Calcopedia (en) → Fibonacci number