Fibonacci Calculator
Find the nth Fibonacci number and list the sequence up to n. Uses BigInt for exact results, so even very large Fibonacci numbers stay precise in your browser.
F(20) =
6765
Sequence F(0) … F(20)
0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987, 1597, 2584, 4181, 6765
What is the Fibonacci Calculator?
The ByteTools Fibonacci Calculator generates the famous sequence where each number is the sum of the two before it: 0, 1, 1, 2, 3, 5, 8, 13 and so on.
- Exact nth Fibonacci number using BigInt
- Lists the full sequence up to n
- Stays precise for very large terms
- Fast iterative calculation, no recursion limits
- Handles n = 0 and small cases correctly
- 100% private — runs entirely in your browser
How to use the Fibonacci Calculator
- 1
Enter n, the position in the sequence you want.
- 2
Read the nth Fibonacci number, computed exactly with BigInt.
- 3
Scroll the listed sequence from the start up to term n.
- 4
Increase n to see how quickly the numbers grow.
- 5
Click Copy to grab the number or the sequence.
About the Fibonacci Calculator
The ByteTools Fibonacci Calculator generates the famous sequence where each number is the sum of the two before it: 0, 1, 1, 2, 3, 5, 8, 13 and so on. Enter n and it returns the nth Fibonacci number and lists the whole sequence up to that point.
Fibonacci numbers grow quickly and soon exceed the range of ordinary floating-point numbers, so this tool uses JavaScript BigInt to keep every digit exact — even at the hundredth term and beyond. It suits students, programmers and anyone exploring number patterns.
The calculation runs entirely in your browser with JavaScript. Nothing is uploaded, so it is private, instant and works offline. Copy the number or the full sequence with one click.
Frequently asked questions
What is the Fibonacci sequence?
The Fibonacci sequence starts with 0 and 1, and every subsequent number is the sum of the previous two: 0, 1, 1, 2, 3, 5, 8, 13, 21. It appears throughout mathematics, nature and computer science.
How do you calculate the nth Fibonacci number?
Add the two preceding numbers repeatedly, starting from 0 and 1, until you reach position n. This calculator does it iteratively with BigInt, so the result is exact no matter how large the term becomes.
Why are Fibonacci numbers so large for big n?
The sequence grows roughly exponentially, multiplying by about 1.618 (the golden ratio) each step. By the hundredth term the number has 21 digits, which is why exact arbitrary-precision arithmetic is needed.
What is the golden ratio's link to Fibonacci?
As you go further along the sequence, the ratio of consecutive Fibonacci numbers approaches the golden ratio, approximately 1.61803. This connection appears in art, architecture and natural growth patterns.
Is the first Fibonacci number 0 or 1?
Conventions vary, but the most common definition begins with 0 as the zeroth term and 1 as the first. This calculator follows that convention, so term 0 is 0, term 1 is 1, term 2 is 1, and so on.
Guides for Fibonacci Calculator
Related tools
Arithmetic Sequence Calculator
Find the nth term and the sum of an arithmetic sequence from the first term, common difference and n. See the formula and the first several terms listed out.
Geometric Sequence Calculator
Find the nth term and sum of a geometric sequence from the first term, common ratio and n. Includes the infinite sum when the ratio is between −1 and 1.
Prime Number Generator
Generate all prime numbers up to a limit, or the first N primes, using a fast sieve. See the full list and the total count, computed instantly in your browser.
Factorial Calculator
Calculate the factorial of any number (n!) exactly using BigInt, and see the full result plus its digit count. Free online factorial calculator.
Prime Number Checker
Check whether a number is prime or composite. See the smallest factor and the full list of factors for any integer up to billions, instantly and privately.