Fibonacci Generator (first N)
Generate the first N Fibonacci numbers using BigInt for overflow-free output. Useful for didactics, algorithm testing and series analysis.
Gera os N primeiros termos da sequência de Fibonacci usando BigInt — sem overflow.
Total: — · Último termo: —
—
The Fibonacci sequence, without losing precision
Each term is the sum of the two before it: 0, 1, 1, 2, 3, 5, 8, 13. Leonardo of Pisa presented it in 1202 as a problem about breeding rabbits, but the pattern shows up far beyond that — in the arrangement of sunflower seeds, in plant branching, in shell spirals. The reason is that the ratio between consecutive terms converges to the golden ratio, which solves efficient packing problems.
Choose how many terms you want and the page generates the sequence. The implementation detail that matters: the numbers are computed with arbitrary-precision integers. The fiftieth term already exceeds 12 billion, and the seventy-ninth exceeds the largest integer a regular JavaScript number represents exactly — from there on, a naive implementation starts returning wrong values with no warning.
Watch out for an indexing trap: some people start counting at 0 and others at 1. This page starts at 0, which is the more common mathematical convention and the one making the closed formula work directly. If you are checking against another source and every value seems shifted by one position, that is almost always why.
Frequently asked questions
How does it relate to the golden ratio?
Why does arbitrary precision matter here?
Does the sequence really appear in nature?
Related Tools
First N Primes Generator
List the first N prime numbers using the Sieve of Eratosthenes. Useful for number-theory exercises, educational cryptography demos and algorithm testing. Runs in your browser.
Perfect Number Generator
List perfect numbers (where the sum of proper divisors equals the number itself) below a ceiling. Examples: 6, 28, 496, 8128.
Prime Factorization Generator
Decompose N into prime factors with exponents (e.g., 360 = 2³·3²·5). Useful for LCM, GCD and number theory.
Divisors Generator
List all positive divisors of N. Shows total count and whether N is prime (only 2 divisors) or perfect.
HTTP Request Builder
Build an HTTP request (URL, method, headers, body) and generate snippets in cURL, fetch, axios, Python requests and Go net/http. Everything in your browser.
Tailwind Config CLI Generator
Generate a ready-to-use tailwind.config.js for the Tailwind CLI, with content paths and theme set up. Copy it and start styling in seconds.