Fibonacci & Lucas Convergence Reference
Every term of the Fibonacci and Lucas sequences from n=0 to n=30, with the ratio of consecutive Fibonacci terms and how far that ratio sits from φ at each step — the one popular golden-ratio claim that holds up to full mathematical scrutiny.
n, F(n), L(n), F(n+1)/F(n), and the error against φ
| n | F(n) | L(n) | F(n+1) / F(n) | Error vs φ |
|---|---|---|---|---|
| 0 | 0 | 2 | — | — |
| 1 | 1 | 1 | 1.0000000000 | 6.1803e-1 |
| 2 | 1 | 3 | 2.0000000000 | 3.8197e-1 |
| 3 | 2 | 4 | 1.5000000000 | 1.1803e-1 |
| 4 | 3 | 7 | 1.6666666667 | 4.8633e-2 |
| 5 | 5 | 11 | 1.6000000000 | 1.8034e-2 |
| 6 | 8 | 18 | 1.6250000000 | 6.9660e-3 |
| 7 | 13 | 29 | 1.6153846154 | 2.6494e-3 |
| 8 | 21 | 47 | 1.6190476190 | 1.0136e-3 |
| 9 | 34 | 76 | 1.6176470588 | 3.8693e-4 |
| 10 | 55 | 123 | 1.6181818182 | 1.4783e-4 |
| 11 | 89 | 199 | 1.6179775281 | 5.6461e-5 |
| 12 | 144 | 322 | 1.6180555556 | 2.1567e-5 |
| 13 | 233 | 521 | 1.6180257511 | 8.2377e-6 |
| 14 | 377 | 843 | 1.6180371353 | 3.1465e-6 |
| 15 | 610 | 1,364 | 1.6180327869 | 1.2019e-6 |
| 16 | 987 | 2,207 | 1.6180344478 | 4.5907e-7 |
| 17 | 1,597 | 3,571 | 1.6180338134 | 1.7535e-7 |
| 18 | 2,584 | 5,778 | 1.6180340557 | 6.6978e-8 |
| 19 | 4,181 | 9,349 | 1.6180339632 | 2.5583e-8 |
| 20 | 6,765 | 15,127 | 1.6180339985 | 9.7719e-9 |
| 21 | 10,946 | 24,476 | 1.6180339850 | 3.7325e-9 |
| 22 | 17,711 | 39,603 | 1.6180339902 | 1.4257e-9 |
| 23 | 28,657 | 64,079 | 1.6180339882 | 5.4457e-10 |
| 24 | 46,368 | 103,682 | 1.6180339890 | 2.0801e-10 |
| 25 | 75,025 | 167,761 | 1.6180339887 | 7.9452e-11 |
| 26 | 121,393 | 271,443 | 1.6180339888 | 3.0348e-11 |
| 27 | 196,418 | 439,204 | 1.6180339887 | 1.1592e-11 |
| 28 | 317,811 | 710,647 | 1.6180339888 | 4.4276e-12 |
| 29 | 514,229 | 1,149,851 | 1.6180339887 | 1.6913e-12 |
| 30 | 832,040 | 1,860,498 | 1.6180339888 | 6.4593e-13 |
Every figure above comes directly from calcFibonacci(), calcLucas(), and the shared PHIconstant this site’s calculators use — the same functions behind the Fibonacci and Lucas calculators, not a separately maintained table.
Why this table is the credible part of the subject
Almost every popular claim about the golden ratio and art, architecture, or the human body turns out to be exaggerated or unsupported once someone checks it against the historical record — covered at length elsewhere on this site. This table is the opposite case: a golden-ratio claim that is not only true, but provably, exactly true, with no measurement, photograph, or overlay involved anywhere.
The ratio column shows F(n+1) divided by F(n) at every step, and the error column shows exactly how far that ratio sits from φ = 1.6180339887… The early rows oscillate — above φ, then below, then above again — before settling into a steady, monotonic shrink from roughly n=5 onward. That shrink isn’t gradual arithmetic; each step’s error is smaller than the previous step’s by a factor very close to φ² (≈2.618), which is why the error collapses from a difference you could measure with a ruler at n=1 down to a difference smaller than a computer’s floating-point precision by n=30.
The Lucas column tells the same story from a different starting point. L(n) satisfies the identical recurrence as F(n) — each term the sum of the two before it — but starts from 2 and 1 instead of 0 and 1. Its own consecutive-term ratio (not shown as a separate column here, but computable the same way from the L(n) values above) converges to the exact same φ, at essentially the exact same rate, which is the clearest evidence that this convergence is a property of the addition rule itself and not a special feature of Fibonacci’s specific starting numbers.
Frequently Asked Questions
Why does row n=0 have no ratio?
The ratio shown is F(n+1)/F(n). At n=0, that's F(1)/F(0) = 1/0, which is undefined — so the ratio and error columns are left blank at that one row rather than showing a divide-by-zero artifact.
Why does the error column shrink so unevenly at first?
The early ratios oscillate above and below φ before settling down, because the correction term in Binet's formula alternates in sign at every step (it's built from a negative number, ψ, raised to increasing powers). The error still shrinks on average by close to a constant factor of φ² per step even during the oscillation — it just doesn't look monotonic until roughly n=5 onward.
Is the Lucas column here just for comparison, or does it matter?
Both — the Lucas sequence satisfies the identical recurrence as Fibonacci, just starting from 2 and 1 instead of 0 and 1, and its own consecutive-term ratio converges to the same φ at the same rate. Seeing both sequences side by side in one table makes it clear the convergence is a property of the recurrence itself, not something special about Fibonacci's specific starting values.
Why does the table stop at n=30 instead of going further?
By n=30 the ratio is already within about 6×10⁻¹³ of φ — smaller than double-precision floating-point arithmetic can meaningfully distinguish from zero. Extending the table further wouldn't show a more convincing convergence, just more rows of a number that's already, for practical purposes, indistinguishable from φ.
Figures are exact integers for F(n) and L(n) (both well within safe-integer range at n≤31), and standard double-precision floating point for the ratio and error columns.
Use it with
- Fibonacci Calculator— compute any single term directly with Binet’s formula, rather than reading it off this table.
- Lucas Number Calculator— compute any Lucas term and verify the Fibonacci–Lucas identity for it directly.
- Golden Ratio Calculator— see φ’s exact value and split any length into golden proportion.
- How the Fibonacci Ratio Converges to the Golden Ratio — the full explanation of the pattern this table lays out.