Fibonacci Generator
Generate Fibonacci sequences up to any term, check if a number is Fibonacci, and watch golden ratio convergence. BigInt support.
Enter 1 to 1,000.
Golden Ratio (φ)
1.6180339887
F(n)/F(n−1) converges to
1.6180340557
20 terms
| n | F(n) | F(n)/F(n−1) |
|---|---|---|
| 0 | 0 | — |
| 1 | 1 | — |
| 2 | 1 | 1.0000000000 |
| 3 | 2 | 2.0000000000 |
| 4 | 3 | 1.5000000000 |
| 5 | 5 | 1.6666666667 |
| 6 | 8 | 1.6000000000 |
| 7 | 13 | 1.6250000000 |
| 8 | 21 | 1.6153846154 |
| 9 | 34 | 1.6190476190 |
| 10 | 55 | 1.6176470588 |
| 11 | 89 | 1.6181818182 |
| 12 | 144 | 1.6179775281 |
| 13 | 233 | 1.6180555556 |
| 14 | 377 | 1.6180257511 |
| 15 | 610 | 1.6180371353 |
| 16 | 987 | 1.6180327869 |
| 17 | 1597 | 1.6180344478 |
| 18 | 2584 | 1.6180338134 |
| 19 | 4181 | 1.6180340557 |
Formulae
F(0) = 0, F(1) = 1, F(n) = F(n−1) + F(n−2)
φ = (1 + √5) / 2 ≈ 1.618034
Fibonacci test: N is Fibonacci iff 5N² ± 4 is a perfect square
Binet's formula: F(n) = (φ^n − ψ^n) / √5, where ψ = 1 − φ
How to use Fibonacci Generator
-
Choose a mode
Select Generate Sequence to list Fibonacci terms, or Check Number to test if a specific number belongs to the sequence.
-
Enter a value
For generation, type how many terms you want. For checking, enter the number to test.
-
View the sequence table
The table shows index, Fibonacci value, and the ratio F(n+1)/F(n) converging toward the golden ratio.
-
Watch golden ratio convergence
The ratio column shows how quickly consecutive terms approach phi ≈ 1.6180339887.
-
Try custom starting values
Enter custom first and second terms to generate generalized Fibonacci sequences like the Lucas numbers.
Fibonacci Generator FAQ
What is the Fibonacci sequence?
What is the formula for the nth Fibonacci number?
How do I check if a number is Fibonacci?
What is the golden ratio?
How many Fibonacci numbers can this generate?
What are generalized Fibonacci sequences?
Where does Fibonacci appear in nature?
Is Fibonacci used in programming?
Can I use this for homework?
Is any data sent to a server?
Background
Generate the Fibonacci sequence up to any number of terms with exact BigInt arithmetic for large values. A checker mode instantly tests whether any number belongs to the sequence using the perfect-square test. A convergence panel shows how the ratio F(n+1)/F(n) approaches the golden ratio (phi ≈ 1.6180339887) as n increases, making this tool as educational as it is practical. Custom starting values let you generate generalized Fibonacci sequences (Lucas numbers, for example). Results are displayed in a clean table with index, value, and ratio columns. Useful for math students exploring number theory, computer science students learning recursion and dynamic programming, and anyone who has spotted the Fibonacci pattern in nature, art, or architecture. All processing runs in your browser — no server calls, no account needed.
Related tools
Factorial Calculator
Calculate n factorial, double factorial, subfactorial, trailing zeros, and digit count. BigInt support for exact large number results.
Prime Number Tools
Check if a number is prime, find prime factorization, list all primes in a range using the Sieve of Eratosthenes, or find the Nth prime.
Ratio Calculator
Simplify ratios, scale to a target value, compare two ratios for equivalence, and convert between ratios, fractions, and percentages. Aspect ratio presets included.
GCD & LCM Calculator
Find the GCD and LCM of up to 10 numbers at once with step-by-step Euclidean algorithm and prime factorization methods.
Statistics Calculator
Calculate mean, median, mode, standard deviation, variance, quartiles, skewness, kurtosis, and range from any dataset. Histogram included.