Fibonacci Sequence Calculator
Build the classic Fibonacci list starting at F0 = 0 and F1 = 1. Enter how many terms you want (up to 78 so every value stays a safe integer). The page lists the full sequence and highlights the last term.
Rated 4.7 out of 5 based on 256 reviews
How to generate a Fibonacci sequence
- Enter the number of terms you want, from 1 through 78.
- Leave the count as 10 to see the default prefix 0, 1, 1, 2, 3, 5, 8, 13, 21, 34.
- Read the sequence row, the last term F(n-1), and the term count under the form.
- Raise the count only when you need a longer prefix. Values past 78 leave the safe integer range this page supports.
- Nothing uploads. The recurrence runs entirely in this tab.
Fibonacci sequence
Integer recurrence F0 = 0, F1 = 1, Fn = F(n-1) + F(n-2)
| F0 | 0 by definition on this page |
|---|---|
| F1 | 1 by definition on this page |
| Recurrence | Each later term equals the sum of the two before it |
| Term count | How many consecutive terms to emit, starting at F0 |
| Index style | Zero-indexed list; last shown term is F(n-1) |
| Range | 1 to 78 terms so every Fibonacci value stays a safe integer |
What this Fibonacci calculator lists
The page prints F0 through F(n-1) using the standard recurrence. With count 10 you get 0, 1, 1, 2, 3, 5, 8, 13, 21, 34 and the last term row shows 34.
Terms, indices, and the recurrence
A term is one integer in the list. The index starts at zero. The recurrence always adds the previous two values. This page does not start at F1 = 1, F2 = 1 unless you skip F0 by reading from the second printed value.
How the sequence is built
The engine seeds a = 0 and b = 1, then walks count steps. Each step appends a, then replaces (a, b) with (b, a + b). That matches F0 = 0, F1 = 1, and Fn = F(n-1) + F(n-2).
When people generate Fibonacci lists
Homework checks, spiral demos, and interview warm-ups all need a short exact prefix. Keep the list short enough that every term stays exact in ordinary JavaScript integers.
Limits
Count must be an integer from 1 to 78. Non-integers and out-of-range counts fail in the status line. This is not a BigInt Fibonacci service and not a closed-form Binet evaluator. See the disclaimer.