Fibonacci Calculator returns the nth term of the Fibonacci sequence and lists every term up to it, built from the rule that each term is the sum of the two before it. Enter a position n between 1 and 1000, and the tool computes that term exactly using integer arithmetic.
Apply the Fibonacci recurrence
The Fibonacci sequence starts with two 1s, and every term after that is the sum of the previous two terms: F(1) = 1, F(2) = 1, and F(n) = F(n−1) + F(n−2) for n greater than 2.
The first several terms are 1, 1, 2, 3, 5, 8, 13, 21, 34, 55. Fibonacci Calculator builds the sequence exactly this way internally, computing each term from the two before it rather than using an approximation formula.
Find a specific term
To find F(10), Fibonacci Calculator builds the sequence up to the tenth position: 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, and returns 55 as F(10).
Because each term depends only on the two immediately before it, computing any single term still requires generating the full sequence up to that point, which is exactly what the calculator does under the hood.
Trace the recurrence step by step
Starting from F(1) = 1 and F(2) = 1, each subsequent term is a single addition: F(3) = F(2) + F(1) = 1 + 1 = 2. F(4) = F(3) + F(2) = 2 + 1 = 3.
F(5) = F(4) + F(3) = 3 + 2 = 5. F(6) = F(5) + F(4) = 5 + 3 = 8. This chain of additions is the entire definition of the sequence; no other formula is needed to generate it term by term.
Connect Fibonacci numbers to the golden ratio
As n grows large, the ratio of consecutive Fibonacci terms, F(n+1) divided by F(n), approaches the golden ratio, approximately 1.618033988749…. Checking with small terms: 55 divided by 34 is approximately 1.6176, already close to the golden ratio after just ten terms.
This connection is one of the most cited properties of the sequence, linking a simple integer recurrence to an irrational constant that also appears in geometry.
Recognize Fibonacci numbers in nature and counting problems
Fibonacci numbers appear in counting problems such as the number of ways to tile a 1-by-n strip using 1-by-1 and 1-by-2 tiles, which follows the exact Fibonacci recurrence: tiling a strip of length n either ends in a single 1-by-1 tile, leaving a strip of length n−1 to tile, or ends in a 1-by-2 tile, leaving a strip of length n−2 to tile.
This tiling connection gives the abstract recurrence a concrete combinatorial meaning beyond the famous rabbit-population story often used to introduce it.
Avoid this common mistake
A common error starts the sequence at F(0) = 0 without adjusting the indexing used elsewhere in a problem, leading to an off-by-one mismatch against a source that starts at F(1) = 1.
Fibonacci Calculator uses the F(1) = 1, F(2) = 1 convention throughout, matching the version most commonly taught; confirm which starting convention a specific problem or textbook uses before comparing term numbers directly.
Compute a larger Fibonacci term
Fibonacci Calculator handles n up to 1000 using exact integer arithmetic rather than a formula that could lose precision. F(20) is 6,765, reached by summing consecutive pairs eighteen times starting from 1, 1.
For much larger positions, such as F(100), the term itself is a 21-digit integer, far too large to compute reliably using the golden-ratio approximation formula without careful high-precision handling; the direct recurrence method avoids this issue entirely by never relying on an irrational number in the computation.
Understand why the recurrence needs two starting values
The Fibonacci recurrence F(n) = F(n−1) + F(n−2) cannot generate any terms on its own without two starting values, since computing F(3) requires already knowing both F(2) and F(1).
This is a general feature of any second-order recurrence relation: two initial conditions are needed to pin down a unique sequence, in the same way a straight line needs two points to be fully determined.
Changing either starting value would produce a completely different, though still valid, recurrence sequence.
Frequently asked questions
What is the Fibonacci sequence?
The Fibonacci sequence is a list of numbers where each term after the first two equals the sum of the two terms before it, starting 1, 1, 2, 3, 5, 8, 13, and continuing indefinitely.
What is the 10th Fibonacci number?
The 10th Fibonacci number is 55, found by summing consecutive pairs of terms starting from 1, 1, 2, 3, 5, 8, 13, 21, 34, 55.
How is the golden ratio related to Fibonacci numbers?
The golden ratio is related to Fibonacci numbers because the ratio of consecutive terms, F(n+1) divided by F(n), converges toward the golden ratio, approximately 1.618, as n grows larger.
Does the Fibonacci sequence start at 0 or 1?
The Fibonacci sequence is presented with different starting conventions in different sources; some start with F(0) = 0 and F(1) = 1, while this calculator uses F(1) = 1 and F(2) = 1, both leading to the same sequence of values shifted by one index.
How do you calculate a Fibonacci number without listing every term?
Calculating a Fibonacci number without listing every prior term is possible using Binet's closed-form formula involving the golden ratio, but it requires careful rounding for large n; the direct recurrence method used by Fibonacci Calculator avoids rounding error entirely by building the sequence term by term.
What are Fibonacci numbers used for?
Fibonacci numbers are used in counting problems such as tiling and staircase-climbing puzzles, in computer science algorithms, and in describing certain natural growth patterns, in addition to their well-known connection to the golden ratio.
What is the 20th Fibonacci number?
The 20th Fibonacci number is 6,765, found by continuing the sum-of-the-previous-two-terms recurrence eighteen times starting from F(1) = 1 and F(2) = 1.
Why does the Fibonacci recurrence need two starting values instead of one?
The Fibonacci recurrence needs two starting values because each term depends on the two terms immediately before it, so computing the third term already requires both the first and second terms to be known in advance.
Summary
Fibonacci Calculator computes the nth term of the sequence F(n) = F(n−1) + F(n−2), starting from F(1) = 1 and F(2) = 1, and lists every term along the way.
Enter n between 1 and 1000 to see the exact term and its full preceding sequence, and note how the ratio of consecutive terms approaches the golden ratio as n grows.