Lucas Number Calculator

About this calculator

The Lucas sequence is defined by the same recurrence rule as Fibonacci — each term is the sum of the two before it (Lₙ = Lₙ₋₁ + Lₙ₋₂) — but it starts from different seed values: 2 and 1 instead of 0 and 1, producing 2, 1, 3, 4, 7, 11, 18, 29... Named after mathematician Édouard Lucas, who used this sequence to study Fibonacci numbers and develop primality tests, it shares deep structural properties with Fibonacci, including the same limiting ratio between consecutive terms that converges to the golden ratio φ ≈ 1.618.

Lucas numbers appear throughout number theory: they're central to the Lucas-Lehmer primality test used to find Mersenne primes (the basis of the largest known prime number searches), they satisfy elegant identities linking them back to Fibonacci numbers (such as Lₙ = Fₙ₋₁ + Fₙ₊₁), and computer science students encounter them as a standard example for practicing both recursive and closed-form (Binet-like) algorithm design.

This calculator computes the nth term of the Lucas sequence directly, letting you skip the manual recurrence and get the exact value for any position n.