Fibonacci Calculator

A Fibonacci calculator generates the Fibonacci sequence — 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55 — where each number equals the sum of the two before it, and returns any nth Fibonacci number directly. For example, the 10th Fibonacci number (zero-indexed) is F(10) = 55. This tool builds terms with exact integer math, so even F(1000) — a 209-digit number — comes out precise.

Working with everyday percentages instead of a number sequence? Reach for the Percentage Calculator for "what is X% of Y", the Percentage Increase Calculator for growth between two figures, the Percentage Change Calculator for a rise or fall as a signed percent, and the Discount Calculator for sale prices — this page is strictly for the Fibonacci integer sequence and its golden-ratio behavior.

The formula behind the sequence

Every term in the sequence comes from one short recurrence rule:

In words: to get the next number, add the previous two. The two "seed" values F(0) = 0 and F(1) = 1 get the sequence started. There is also a remarkable closed-form expression, known as Binet's formula, that produces the nth term without building all the earlier ones:

where φ (phi) = (1 + √5)/2 ≈ 1.6180339887 is the golden ratio and ψ (psi) = (1 − √5)/2 ≈ −0.6180339887. Because ψⁿ quickly shrinks toward zero, F(n) is extremely close to φⁿ ÷ √5, and you can recover the exact integer by rounding. This calculator uses the recurrence with exact integer math rather than the floating-point Binet formula, so the answers stay precise for every term.

A worked example: finding F(10)

Suppose you want the 10th Fibonacci number using the zero-indexed convention. You build the list step by step, each time adding the previous two:

So F(10) = 55. Notice the ratio of consecutive terms is already homing in on the golden ratio: 34/21 ≈ 1.6190 and 55/34 ≈ 1.6176, both close to φ ≈ 1.6180. The further you go, the tighter that ratio gets — that is the headline relationship between Fibonacci numbers and the golden ratio.

Fibonacci sequence chart: the first 20 terms

This reference table lists every Fibonacci number from F(0) through F(20), the running sum of all terms up to that point, and the ratio to the previous term. The two index columns show why "the 7th Fibonacci number" can mean 8 or 13 depending on whether you count from 0 or from 1.

The running sum confirms the identity F(0) + … + F(n) = F(n+2) − 1: for n = 10 the sum is 143, and F(12) − 1 = 144 − 1 = 143.

How to use this Fibonacci calculator

Three inputs control everything, and the result updates as soon as you generate it:

1. Number of terms: how many values of the sequence to list out (for example, 15 gives the first fifteen terms).
2. nth term: the single position n whose Fibonacci number you want returned on its own — handy when you only need F(50) and do not want to scan a long list.
3. Start the sequence at: choose F(0) = 0 (zero-indexed, the standard math convention) or F(1) = 1 (one-indexed, common in textbooks and puzzles).

Press Generate sequence and the calculator shows the listed terms, the nth Fibonacci number, the sum of the listed terms, and the ratio of the final two terms so you can watch it converge on φ.

Who this calculator is for

The Fibonacci calculator is useful for a wide range of people:

• Students checking homework on sequences, recurrences, and the golden ratio.
• Teachers generating example sequences and sums quickly for a lesson or worksheet.
• Programmers verifying the output of a recursive or iterative Fibonacci function, including for large n where overflow matters.
• Puzzle and trivia fans who want an exact F(n) without doing the long addition by hand.
• Designers and hobbyists curious about the golden ratio and where Fibonacci numbers appear in spirals and proportions.

Zero-indexed vs one-indexed: why the labels differ

One common source of confusion is whether the sequence "starts" at 0 or 1. The values are identical either way; only the index labels shift. In the zero-indexed convention, F(0) = 0, F(1) = 1, F(2) = 1, F(3) = 2, and so on. In the one-indexed convention, F(1) = 1, F(2) = 1, F(3) = 2. So "the 7th Fibonacci number" is F(7) = 13 if you count from index 0, but the 7th term written out (1, 1, 2, 3, 5, 8, 13) is also 13 when you count from index 1 — the off-by-one is in the label, not the value. Because that single index assumption can change which number you read off, this calculator makes the convention explicit and lets you pick the one your assignment or reference uses.

Key terms explained

• Recurrence relation: a rule that defines each term from earlier ones — here, "add the previous two."
• Seed values: the starting numbers (0 and 1) that the recurrence needs before it can produce anything.
• nth term: the Fibonacci number at position n, written F(n).
• Golden ratio (φ): the constant (1 + √5)/2 ≈ 1.618 that the ratio of consecutive Fibonacci numbers converges to.
• Binet's formula: the closed-form expression for F(n) using φ and ψ.
• Big-number arithmetic: exact integer math that handles numbers with hundreds of digits, which ordinary floating-point cannot represent precisely.

Patterns and identities worth knowing

The Fibonacci numbers hide a surprising number of clean identities. A few you can verify with this calculator:

• Sum of the first terms: F(0) + F(1) + … + F(n) = F(n+2) − 1. For example, 0 + 1 + 1 + 2 + 3 + 5 = 12 = F(7) − 1.
• Every third number is even: 0, 2, 8, 34, 144 … — the rest are odd, in a strict pattern.
• Consecutive terms share no common factor: gcd(F(n), F(n+1)) = 1, so neighboring Fibonacci numbers are always coprime.
• Ratio converges to φ: F(n+1) / F(n) approaches the golden ratio as n grows, alternating just above and just below it.
• Sum of squares: F(1)² + F(2)² + … + F(n)² = F(n) × F(n+1).

How Fibonacci ratios converge to the golden ratio

Dividing each Fibonacci number by the one before it produces a sequence that zig-zags above and below the golden ratio φ = 1.6180339887, closing in fast. This table shows the ratio and its signed error from φ at each step.

By the 21st ratio the error is down to one part in 100 million, and the sign flips at every step — the hallmark of Fibonacci convergence to φ.

Computing Fibonacci numbers: three ways

There is more than one route to F(n), and the right one depends on how big n is:

• Naive recursion — calling fib(n) = fib(n−1) + fib(n−2) directly. Simple to write, but it recomputes the same values exponentially many times and becomes unusably slow past about n = 40.
• Iteration (or memoization) — keep the last two values and loop forward. This runs in linear time and is what this calculator uses, plus exact big-number addition so large terms stay precise.
• Fast doubling / matrix power — uses identities like F(2k) = F(k) × (2F(k+1) − F(k)) to reach F(n) in roughly log(n) steps, the method of choice for enormous n.

If you are writing code, remember that F(n) outgrows a 64-bit integer around F(92), so anything larger needs big-integer support — exactly the kind of overflow this calculator avoids.

What is the nth Fibonacci number? Milestone values

These are exact zero-indexed Fibonacci numbers at popular positions, with a digit count so you can see how fast they grow. Large values are shown truncated; the calculator returns every digit in full.

Digit count grows by roughly log₁₀(φ) ≈ 0.209 per term, so F(n) has about n × 0.209 + 1 digits — F(100) lands at 21 digits, F(1000) at 209.

Where Fibonacci shows up

Beyond the classroom, Fibonacci numbers and the golden ratio appear in many places. In nature, the spirals of sunflower seeds, pinecones, and pineapples often follow Fibonacci counts, and leaves frequently arrange around a stem in Fibonacci-related angles to capture light efficiently. In computer science, Fibonacci numbers underpin the Fibonacci heap data structure and appear in algorithm analysis. In finance, traders draw "Fibonacci retracement" levels, though that use is a heuristic rather than a mathematical law. It is worth a healthy dose of skepticism: popular media often over-claims Fibonacci sightings, attaching the sequence to designs or shells that only loosely fit. The genuine, provable connection is the convergence of consecutive ratios to the golden ratio — the rest ranges from real to coincidental.

Tips for getting the answer you want

• Match the index convention to your textbook or assignment before you trust an F(n) value — the off-by-one trips people up constantly.
• Use the nth-term field when you only need one number; you do not have to list a thousand terms to read F(500).
• Watch the ratio at the bottom: with enough terms it should read 1.618034, confirming convergence to φ.
• Cross-check identities like the sum formula F(n+2) − 1 using the sum the calculator reports.

Limitations and assumptions

• The sequence is capped at 1,000 terms to keep the page responsive; that is far more than most uses require (F(1000) already has 209 digits).
• It computes the standard Fibonacci sequence with seeds 0 and 1. It does not handle custom seeds, Lucas numbers, or negative-index "negafibonacci" terms.
• The displayed ratio uses ordinary floating-point division of the last two terms, so it shows about six accurate decimals; the sequence values themselves are exact integers.
• This is an educational tool for the integer sequence, not a statement about any real-world claim that "follows Fibonacci."

Related math calculators

If your question is a little different, a sister tool may fit better:

• For products like n! that grow even faster than Fibonacci, use the Factorial Calculator.
• To count arrangements and selections, use the Permutation & Combination Calculator.
• To break a number into primes, use the Prime Factorization Calculator.
• For powers like φⁿ, use the Exponent Calculator, and for √5 in Binet's formula, the Square Root Calculator.
• For trig, logs, and general computation, use the Scientific Calculator.

About this formula

The Fibonacci sequence is a standard, well-established mathematical definition — F(n) = F(n−1) + F(n−2) with F(0) = 0 and F(1) = 1 — so the results here are deterministic and need no external data source. The closed-form Binet expression and the convergence of consecutive ratios to the golden ratio φ = (1 + √5)/2 are classical results that follow directly from that recurrence. Because no legal, tax, or measured figures are involved, there are no primary sources to cite; the math itself is the authority.