Fibonacci Series Calculator

Free Online Fibonacci Series Calculator

This Fibonacci series calculator finds the value of any term in the Fibonacci sequence, calculates the sum of a Fibonacci series (the running total of its terms) up to any position, and locates exactly which position a given number occupies in the sequence — all instantly, with a labeled growth diagram and a full step-by-step solution showing exactly how each term and each partial sum was built.

Unlike a basic Fibonacci sequence generator that only starts from 1, 1, this calculator also supports custom starting values, so you can generate any Fibonacci-style sequence (sometimes called a generalized Fibonacci sequence or a Lucas-style sequence) just by changing the first two seed terms. The same Fₙ = Fₙ₋₁ + Fₙ₋₂ recurrence rule applies no matter what numbers you start with, and every result — the nth term, the running sum, and the golden-ratio approximation — updates instantly as you type, with no need to manually add terms by hand or keep track of a long running list yourself.

What Is the Fibonacci Sequence?

The Fibonacci sequence is a list of numbers where every term (after the first two) is found by adding the two terms immediately before it: 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, and so on. It's one of the most famous sequences in all of mathematics, discovered in the West by Leonardo of Pisa (known as Fibonacci) in the 13th century, though it was described in Indian mathematics centuries earlier.

What makes the Fibonacci sequence special is that its growth pattern shows up throughout nature, art, and science — from the spiral arrangement of sunflower seeds and pinecones to the branching of trees and the proportions of the golden ratio, which the sequence approaches more and more closely the further you go.

Fibonacci Sequence Formula

The Fibonacci sequence is defined by a simple recurrence relation, plus two starting values (seeds):

• Recurrence relation: Fₙ = Fₙ₋₁ + Fₙ₋₂ (for n ≥ 3)
• Classic Fibonacci seeds: F₁ = 1, F₂ = 1
• Sum of the first n terms: Sum = F(n+2) − F₂
• Golden ratio approximation: Fₙ / Fₙ₋₁ → φ ≈ 1.6180339887 as n grows large
• Binet's closed-form formula (classic seeds only): Fₙ = (φⁿ − ψⁿ) / √5, where φ = (1+√5)/2 and ψ = (1−√5)/2

How to Use This Fibonacci Calculator

Start by choosing what you want to solve for: the nth term of the sequence, or the position of a specific value within the sequence. Enter the first two terms (F₁ and F₂) — leave them at 1 and 1 for the standard Fibonacci sequence, or enter any other pair of starting numbers to build a custom sequence that still follows the same 'add the previous two' rule.

If you're solving for the nth term, enter the position n you want and the calculator instantly builds the sequence up to that point and returns the value, the sum of all terms so far, and (for n ≥ 3) the ratio of the last two terms as it converges toward the golden ratio. If you're solving for a position instead, enter the value you're looking for, and the calculator searches the sequence and tells you exactly which term number it is — or explains clearly if that value never appears in the sequence at all.

Worked Example: Finding the nth Term

Suppose you want the 10th Fibonacci number using the classic seeds F₁ = 1 and F₂ = 1. Building the sequence term by term: 1, 1, 2, 3, 5, 8, 13, 21, 34, 55 — the 10th term is F₁₀ = 55.

The sum of these first 10 terms is 1+1+2+3+5+8+13+21+34+55 = 143, which matches the shortcut formula Sum = F(n+2) − F₂ = F₁₂ − F₂ = 144 − 1 = 143. This confirms the sum formula without having to add every term by hand.

Worked Example: Finding the Position of a Value

Now suppose you're given the number 89 and asked which term of the classic Fibonacci sequence it is. Generating the sequence — 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89 — shows that 89 is the 11th term, so F₁₁ = 89.

If instead you searched for a number that never appears in the sequence, such as 90, the calculator would search through the terms, confirm that 90 never shows up between 89 and 144, and report that clearly rather than returning a false or misleading position.

Worked Example: A Custom Fibonacci-Style Sequence

The recurrence rule Fₙ = Fₙ₋₁ + Fₙ₋₂ doesn't require the classic seeds of 1 and 1 — any two starting numbers work identically. For example, using F₁ = 2 and F₂ = 1 produces the sequence 2, 1, 3, 4, 7, 11, 18, 29, 47, 76, which is known as the Lucas sequence, a close cousin of the Fibonacci sequence that shows up in some of the same mathematical identities.

Try entering F₁ = 2 and F₂ = 1 with n = 10 in this calculator to see the Lucas sequence generated automatically, using exactly the same recurrence and diagram as the classic Fibonacci case.

What Is a Fibonacci Series? Sum of Fibonacci Numbers Explained

A Fibonacci sequence is the ordered list of individual terms (1, 1, 2, 3, 5, 8, ...), while a Fibonacci series is what you get when you add those terms together — the running total, sometimes written as Sₙ = F₁ + F₂ + F₃ + ... + Fₙ. This calculator computes that series sum automatically every time, right alongside the individual term you asked for, so you never need a separate 'Fibonacci series calculator' to get the running total.

There's a neat shortcut for adding up a Fibonacci series without summing every term by hand: the sum of the first n Fibonacci numbers always equals F(n+2) − F₂ — two terms further along in the same sequence, minus the second seed. This identity holds for the classic 1, 1 seeds and for any custom Fibonacci-style sequence you build with different starting values, because it follows directly from the recurrence relation itself rather than the specific numbers you start with.

Worked Example: Summing a Fibonacci Series

Suppose you want the Fibonacci series sum for the first 8 terms of the classic sequence. The terms are 1, 1, 2, 3, 5, 8, 13, 21, and adding them by hand gives 1+1+2+3+5+8+13+21 = 54.

Using the series shortcut instead: Sum = F(n+2) − F₂ = F₁₀ − F₂ = 55 − 1 = 54 — the exact same answer, found without adding eight separate numbers. Enter n = 8 with the classic seeds in the 'nth Term' mode above and check the 'Sum of first n terms' result to see this calculated instantly, alongside the full series build-up in the growth diagram.

Understanding the Growth Diagram

The diagram is built so you can understand how the sequence is generated just by looking at it. Each bar represents one term, colored by role — amber for the two seed terms, indigo for the middle terms, and green for the target term you asked about — and every bar is labeled directly with its own exact value.

The most important feature is the small pink caption above each bar from the third term onward: it shows the exact two earlier values that were added together to produce that bar. For example, the caption '5+8' sitting above the bar for 13 shows visually, with real numbers, exactly how that term was generated — turning the abstract recurrence relation into something you can read directly off the chart. Because Fibonacci numbers grow almost as fast as a geometric sequence, bar heights use a compressed (logarithmic) scale so both small and large terms stay visible together, while every printed number remains the exact, un-rounded value.

The Golden Ratio and the Fibonacci Sequence

One of the most famous properties of the Fibonacci sequence is that the ratio of consecutive terms, Fₙ / Fₙ₋₁, gets closer and closer to the golden ratio, φ ≈ 1.6180339887, as n increases — and this holds true no matter which two seed values you start the sequence with. This calculator computes that ratio automatically whenever n is 3 or greater, so you can watch it converge toward φ as you increase n.

The golden ratio itself appears throughout art, architecture, and design because proportions close to 1.618:1 are widely considered visually pleasing, and it's part of why the Fibonacci sequence has fascinated mathematicians, artists, and scientists for centuries.

Real-World Applications of the Fibonacci Sequence

Beyond pure mathematics, Fibonacci numbers and the golden ratio they approach show up in a surprising range of practical and natural contexts:

• Phyllotaxis — the spiral arrangement of leaves, seeds, and petals in plants like sunflowers, pinecones, and succulents often follows Fibonacci numbers.
• Computer science, where Fibonacci numbers appear in algorithm analysis, data structures like Fibonacci heaps, and certain search techniques.
• Financial markets, where some traders use Fibonacci retracement levels (based on Fibonacci ratios) as a technical analysis tool.
• Art, architecture, and photography, where compositions based on the golden ratio are often described as more visually balanced.
• Population growth models, since the original medieval problem Fibonacci solved was about the growth of a hypothetical rabbit population.
• Music and rhythm, where some composers have used Fibonacci numbers to structure phrase lengths and musical form.

Fibonacci Numbers vs. Lucas Numbers

The Lucas sequence is the most famous 'sibling' of the Fibonacci sequence — it follows the exact same recurrence rule, Lₙ = Lₙ₋₁ + Lₙ₋₂, but starts from the seeds L₁ = 2 and L₂ = 1 instead of 1 and 1. That single change in starting values produces a completely different sequence: 2, 1, 3, 4, 7, 11, 18, 29, 47, 76, 123, and so on.

Despite starting differently, Fibonacci and Lucas numbers are deeply connected — for example, Lₙ = Fₙ₋₁ + Fₙ₋₁, and the ratio of consecutive Lucas numbers converges to the exact same golden ratio, φ, that Fibonacci numbers converge to. You can generate the Lucas sequence in this calculator simply by entering F₁ = 2 and F₂ = 1 instead of the classic 1 and 1.

Common Mistakes When Working with Fibonacci Numbers

A frequent mistake is treating F₀ = 0 and F₁ = 1 as the two seed terms instead of F₁ = 1 and F₂ = 1 — both conventions exist in different textbooks, and mixing them up shifts every term's index by one position. This calculator uses the F₁ = 1, F₂ = 1 convention, which is the most common in introductory algebra and precalculus courses.

Another common error is assuming the sequence always starts at 1, 1 — as the custom-seed examples above show, the identical addition rule works perfectly well starting from any two numbers, including negative numbers or decimals, producing a valid generalized Fibonacci-style sequence every time.

Tips for Working with Fibonacci Sequences

Remember that the recurrence rule Fₙ = Fₙ₋₁ + Fₙ₋₂ only kicks in from the 3rd term onward — the first two terms are always just your chosen seed values, not the result of any addition. If you ever see a claimed Fibonacci-style sequence where the third term doesn't equal the sum of the first two, it isn't following the standard recurrence rule.

When searching for the position of a specific value, keep in mind that Fibonacci numbers grow quickly, so most 'reasonable' target numbers correspond to a term position well under 50 — if a value doesn't appear anywhere in the first several dozen terms, it very likely isn't part of that particular sequence at all.