Fibonacci Generator

0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377

Golden ratio approximation: 1.61802575

What is the Fibonacci Sequence?

The Fibonacci sequence is a series of numbers where each term is the sum of the two preceding ones: 0, 1, 1, 2, 3, 5, 8, 13, 21, 34… Starting from 0 and 1, the sequence grows rapidly and appears throughout mathematics, nature, art, and computer science. This generator supports up to 50 terms using BigInt for exact large-number arithmetic.

How to Use

  1. Select "First N Terms" to generate a sequence, or "Find Nth Term" to get a specific term.
  2. Enter the number of terms (up to 50) or the term position you want.
  3. The sequence or single term is displayed instantly, along with the golden ratio approximation.

Frequently Asked Questions

What is the golden ratio and how does it relate to Fibonacci?

The golden ratio (φ ≈ 1.618) is the limit of the ratio of consecutive Fibonacci numbers: F(n+1)/F(n) → φ as n increases. This ratio appears in architecture, art, nature (spirals in sunflowers, shells), and is considered aesthetically pleasing.

Where does Fibonacci appear in nature?

Fibonacci numbers appear in the spiral arrangements of sunflower seeds, pine cone scales, pineapple scales, leaf arrangements (phyllotaxis), and nautilus shell spirals. The counts of spirals in these structures are almost always consecutive Fibonacci numbers.

How large do Fibonacci numbers get?

Fibonacci numbers grow exponentially — F(50) is already over a trillion. F(100) ≈ 3.5 × 10²⁰. This calculator uses JavaScript's BigInt type to handle exact integer arithmetic for large terms without losing precision.

Who was Fibonacci?

Leonardo of Pisa (c. 1170–1250), known as Fibonacci, introduced the Hindu-Arabic numeral system to Europe in his book Liber Abaci (1202). The sequence he described (in a rabbit breeding problem) had been known in Indian mathematics centuries earlier.

The Sequence

Each number is the sum of the two preceding ones: 0, 1, 1, 2, 3, 5, 8, 13, 21…

F(n) = F(n-1) + F(n-2)