About Fibonacci Generator
The Fibonacci sequence starts with 0 and 1, and every later term is the sum of the two before it: F(n) = F(n − 1) + F(n − 2). That gives 0, 1, 1, 2, 3, 5, 8, 13 and so on. This generator lists the first n terms, one per line, using exact big-integer arithmetic, so even very large terms are not rounded. You can request between 1 and 1,000 terms.
How to use Fibonacci Generator
- Fill in "Number of terms".
- The result appears below and updates as you type.
- Copy the result with the copy button, or download it as a file where that is offered.
Questions about Fibonacci Generator
Does the Fibonacci sequence start at 0 or 1?
Both conventions exist. This generator uses the modern one that starts 0, 1, 1, 2. If you need the older form that starts 1, 1, 2, ignore the first line of the output.
Runs in your browser. Page last updated .