It is a sequence of integers where each term is the sum of the two preceding ones: 0, 1, 1, 2, 3, 5, 8, 13, 21, 34… It was popularized by Leonardo of Pisa ('Fibonacci') in the 13th century.
Fibonacci Sequence Generator
Generate the first N terms of the Fibonacci sequence with BigInt precision.
Fibonacci sequence with arbitrary precision.
The Fibonacci sequence is defined by F(0) = 0, F(1) = 1, and F(n) = F(n-1) + F(n-2) for n ≥ 2. This tool uses BigInt to compute up to 500 terms with exact precision, with no floating-point rounding. The last generated term can have hundreds of digits.
Enter how many terms you want to generate.
- Enter the number of terms (1 to 500).
- View the paginated table with the index and value of each term.
- Check the last generated term, its digit count, and the golden ratio approximation.
Sources and references for this tool
These references help contextualize formulas, standards, APIs and limitations used on this page. They do not replace professional validation when a result has legal, financial, medical or operational impact.
- Fibonacci Numbers — Wolfram MathWorldWolfram MathWorld — Definition, properties and identities of the Fibonacci sequence.
- The On-Line Encyclopedia of Integer Sequences (OEIS) — A000045OEIS Foundation — Canonical OEIS entry for the Fibonacci sequence.
- BigIntMDN Web Docs — API used for large Fibonacci terms without overflow.