Generate the first N terms of the Fibonacci (or Lucas) sequence, or jump straight to a single huge nth term with BigInt precision. See the golden-ratio convergence, digit counts, and sum. No server โ everything runs in your browser.
Max 10,000 terms. Terms beyond ~20,000 digits get very large fast โ but BigInt can still handle them.
Compute a single term without generating the whole sequence โ works in O(log n).
| Generate a sequence to see terms |