What is the Fibonacci sequence?

The Fibonacci sequence is a series where each number is the sum of the two preceding ones, starting with 0 and 1: 0, 1, 1, 2, 3, 5, 8, 13, 21, 34... It was described by Fibonacci in his 1202 book Liber Abaci and appears in many natural phenomena including plant growth patterns, spiral shells, and flower petal counts.

What is the golden ratio and how is it related to Fibonacci?

The golden ratio (φ, phi) is approximately 1.6180339887. As you compute consecutive Fibonacci numbers and divide each by its predecessor, the ratio converges toward φ. For example, 89/55 = 1.6181, 144/89 = 1.6179. This relationship is why Fibonacci spirals and the golden ratio appear together in nature and art.

How do I calculate the Nth Fibonacci number without computing all previous terms?

Binet's formula gives F(n) = (φⁿ - ψⁿ) / √5, where φ = (1+√5)/2 and ψ = (1-√5)/2. For very large n, φⁿ dominates and F(n) ≈ round(φⁿ / √5). However, for exact large integer results, iterative computation or matrix exponentiation is more precise than floating-point Binet.

Where does the Fibonacci sequence appear in nature?

Fibonacci numbers appear in the spiral arrangement of sunflower seeds (typically 34 and 55 spirals), the number of petals on many flowers (3, 5, 8, 13, 21), the branching patterns of trees, the arrangement of leaves around a stem (phyllotaxis), and the spiral structure of nautilus shells.

What is the largest Fibonacci number this tool can compute?

This tool uses JavaScript BigInt for the sequence generator, providing arbitrary-precision integers with no overflow limit. You can compute F(1000) — a 209-digit number — or even larger terms. The Nth Term calculator also uses BigInt for exact results.

Fibonacci Sequence Generator

Generate Fibonacci sequences, compute any Nth term with BigInt precision, and explore golden ratio convergence.

First terms

Click Generate to produce the sequence.

Click Generate to produce the Fibonacci sequence.

How to Use the Fibonacci Generator

Sequence mode — enter how many terms you want (up to 500) and click Generate. The output uses BigInt so large numbers are exact.
Nth Term mode — enter any index n and compute F(n) directly. F(1000) is a 209-digit number displayed in full.
Golden Ratio mode — see a table of consecutive ratios F(n)/F(n-1) converging toward φ ≈ 1.6180339887 with visual precision bars.

The Fibonacci Sequence Explained

The Fibonacci sequence begins 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144… Each term is the sum of the two before it. The sequence is named after Leonardo of Pisa (nicknamed Fibonacci), who described it in his 1202 book Liber Abaci in the context of rabbit population growth. The sequence had been described centuries earlier by Indian mathematicians including Virahanka and Gopāla in the context of Sanskrit prosody.

The Golden Ratio Connection

Divide any Fibonacci number by the one before it: 5/3 = 1.667, 8/5 = 1.6, 13/8 = 1.625, 21/13 = 1.615, 34/21 = 1.619, 55/34 = 1.6176... The ratios oscillate above and below φ = 1.6180339887... and converge toward it rapidly. This relationship follows from the closed-form Binet's formula: F(n) = (φⁿ − ψⁿ) / √5, where ψ = (1 − √5)/2 ≈ −0.618. Since |ψ| < 1, ψⁿ → 0, so F(n) ≈ φⁿ / √5 for large n.

Fibonacci in Nature

The Fibonacci spiral — constructed by drawing quarter circles in squares whose sizes follow the sequence — approximates the golden spiral seen in nautilus shells. Sunflowers have 34 clockwise and 55 counterclockwise spirals of seeds, both Fibonacci numbers. Pinecone scales, pineapple skins, and artichoke leaves all display Fibonacci spiral patterns. This occurs because Fibonacci spacing minimizes packing waste — each new leaf or seed grows at approximately 137.5° (the golden angle, derived from φ) from the previous one, resulting in no two leaves directly above each other competing for sunlight.

Fibonacci in Computer Science

The Fibonacci sequence appears throughout algorithm analysis. Fibonacci heaps (a data structure) achieve better amortized complexity for priority queues. The Fibonacci search technique divides arrays using Fibonacci numbers rather than halving. The recursive Fibonacci function is the classic example of exponential time complexity (O(2ⁿ) naive) vs. efficient dynamic programming (O(n)), making it a standard teaching example for memoization and iterative solutions. Matrix exponentiation reduces Fibonacci computation to O(log n) time.

Fibonacci Numbers and Art

The golden ratio derived from Fibonacci appears throughout classical art and architecture. The Parthenon's facade dimensions approximate the golden rectangle. Leonardo da Vinci's illustrations for De Divina Proportione explore φ in human anatomy. Many painters, including Salvador Dalí, consciously used the golden spiral in their compositions. Whether or not these historical uses were intentional, the human perception system does find proportions near φ aesthetically pleasing — possibly because so much of the natural world follows these patterns.

Frequently Asked Questions

The Fibonacci sequence is a series where each number is the sum of the two preceding ones, starting with 0 and 1: 0, 1, 1, 2, 3, 5, 8, 13, 21, 34... It appears in many natural phenomena including plant growth patterns, spiral shells, and flower petal counts.

The golden ratio (φ ≈ 1.6180339887) is the limit of consecutive Fibonacci ratios. F(n+1)/F(n) → φ as n → ∞. This relationship arises from Binet's formula: F(n) = (φⁿ − ψⁿ) / √5, where ψ ≈ −0.618.

Binet's formula gives F(n) = (φⁿ − ψⁿ) / √5. For exact large integer results, iterative computation or matrix exponentiation is more precise than floating-point Binet. This tool uses iterative BigInt for exact results.

Fibonacci numbers appear in sunflower seed spirals (34 and 55), flower petal counts (3, 5, 8, 13), tree branching patterns, leaf arrangements (phyllotaxis), and the spiral structure of nautilus shells — all because Fibonacci spacing minimizes overlap.

This tool uses JavaScript BigInt, providing arbitrary-precision integers. You can compute F(1000) — a 209-digit number — or F(10000) and beyond. The Nth Term calculator iterates to find exact results with no floating-point error.