Fibonacci Calculator
Enter a position n and get F(n), the nth Fibonacci number — the sequence that starts 0, 1 and builds every term from the two before it.
One index, one answer
Enter the position n and the calculator returns F(n) — for example F(10) = 55, the tenth term counting from F(0) = 0.
Exact up to F(78)
Beyond F(78) the values grow larger than a computer can hold exactly, so the calculator returns no result above index 78 rather than a rounded one.
What is a Fibonacci calculator?
Index in, Fibonacci number out
A Fibonacci calculator turns a single position — the index n — into F(n), the number that sits at that spot in the famous Fibonacci sequence. The sequence starts 0, 1 and then keeps adding the two most recent terms: 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, and on. Because each term is fixed once you know the two before it, the index alone tells you the value. That makes this the tool you reach for in maths homework, coding interviews, and any time you want the nth term without writing out the whole chain by hand.
Enter a whole number from 0 to 78 to get its Fibonacci number instantly.
One short rule, applied from the bottom of the sequence upward, starting from the two fixed values F(0) = 0 and F(1) = 1.
F(n) = F(n − 1) + F(n − 2)The calculator does not call itself over and over — that would repeat the same work countless times. Instead it keeps just two running numbers, starts them at 0 and 1, and steps forward one term at a time until it reaches position n. After n steps the first of the two numbers holds F(n), so the answer arrives quickly even for large indices.
Suppose you want F(10), the Fibonacci number at position 10.
Start the pair
Begin with F(0) = 0 and F(1) = 1 — the two fixed seed values.
Build up the sequence
Add the last two each time: 1, 2, 3, 5, 8, 13, 21, 34, 55 — that is F(2) through F(10).
Read the answer
The term at position 10 is 55, so F(10) = 55.
The number you get back is simply the term that sits at position n in the sequence, with F(0) = 0 as the very first term. So F(10) = 55 means the eleventh value in the chain (the zeroth, first, second, … up to the tenth) is 55. The most striking thing about these numbers is what happens when you divide each one by the term before it: the ratios close in on the golden ratio φ ≈ 1.618. For instance 55 ÷ 34 ≈ 1.6176 and the next pair 89 ÷ 55 ≈ 1.6182 — the larger the index, the tighter the result hugs φ. That single property is why the sequence turns up so widely: in the spirals of sunflower heads and pinecones, in the branching of trees and the arrangement of leaves, and across computer science in algorithms, data structures, and search techniques. The values also grow fast — roughly multiplying by 1.618 each step — which is why this tool caps out at F(78): beyond that the exact whole number no longer fits in a standard computer number without rounding.
The recurrence is exact, but a couple of practical points are worth keeping in mind.
Whole indices and the precision ceiling
The index n must be a whole number from 0 upward — there is no Fibonacci term at a fraction or a negative position here, so those return no result. The calculator also stops at F(78) = 8,944,394,323,791,464, the last term that a standard computer number can store exactly. Asking for a larger index returns no result rather than a value that has quietly lost precision.