Fibonacci Number Calculator
F(n) = F(n−1) + F(n−2). 0, 1, 1, 2, 3, 5, 8, 13, 21, ...
Result
How to use this calculator
- Enter n.
- Read F(n) + ratio + golden-ratio comparison.
About this calculator
Fibonacci sequence: 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, ... Each term = sum of previous two. Defined by F(0)=0, F(1)=1, F(n)=F(n−1)+F(n−2). Ratio F(n)/F(n−1) → golden ratio Φ = (1+√5)/2 ≈ 1.618 as n → ∞. Closed form (Binet): F(n) = (Φⁿ − (−1/Φ)ⁿ) / √5. Appears in nature: pinecones, sunflowers, nautilus shells, branching patterns, art (Parthenon proportions).
Frequently asked
Where in nature?+
Golden ratio?+
Binet's formula?+
Big numbers?+
Why so famous?+
Related calculators
More tools you might like
Hand-picked tools that pair well with this one — same audience, same intent.
n! = 1 × 2 × … × n. Computes exactly up to 21! (number limit); approximate via Stirling for larger.
aₙ = a₁ + (n−1)d. Find any term of an arithmetic sequence.
aₙ = a₁ × r^(n−1). Find any term of a geometric sequence.
Sₙ = n × (a₁ + aₙ) / 2 = n/2 × (2a₁ + (n−1)d).
Sₙ = a₁(1 − rⁿ) / (1 − r) for r ≠ 1. Infinite: S∞ = a₁/(1−r) if |r|<1.
Drop one or many shipping-label PDFs — extract every detected tracking number (USPS / UPS / FedEx / DHL pattern) into a CSV.