Leave blank for standard Fibonacci (0, 1). Change both seeds to generate Lucas or custom sequences.
Returns F(n) — the number at position n. F(0)=0, F(1)=1, F(2)=1, F(3)=2 …
Uses the perfect square test: N is Fibonacci if (5N²+4) or (5N²−4) is a perfect square.
Golden Ratio Convergence — F(n) / F(n-1) → φ ≈ 1.6180339887…
| n (Index) | F(n) — Fibonacci Number | F(n) / F(n-1) — Ratio → φ | Running Sum |
|---|