Lucas Number Calculator

How it is calculated

The Lucas numbers follow the Fibonacci rule Ln = Ln−1 + Ln−2, but start from the seeds L0 = 2 and L1 = 1, giving 2, 1, 3, 4, 7, 11, 18, 29 and so on. The tool starts with the pair 2 and 1, adds the previous two terms until it reaches position n, and prints the last term as a whole number. The numbering is the standard one: n = 0 gives 2, n = 1 gives 1, n = 2 gives 3, n = 3 gives 4, n = 5 gives 11. The input must be a whole number from 0 to 90; negatives, decimals, 91 and above, and an empty box give nothing. The arithmetic is exact integer arithmetic, so even the largest result (n = 90, which is 6,440,026,026,380,244,498) is shown digit for digit; 90 is the limit because the next term no longer fits in a 64-bit integer.

Common mistakes

• Counting positions from 1 when the sequence starts at index 0. L₀ = 2 is the first number listed, so n = 1 gives 1 and n = 2 gives 3; the 5th number in the list 2, 1, 3, 4, 7 is L₄, not L₅.
• Confusing Lucas with Fibonacci. Both use the same addition rule, but Lucas starts at 2 and 1, so L₁₂ = 322 while F₁₂ = 144.
• Entering 0 and expecting nothing. Zero is a valid position and returns 2, the first seed.
• Asking for a position above 90 or a fractional position such as 2.5. The tool needs a whole number from 0 to 90 and shows no result otherwise.
• Expecting a rounded or approximate answer for large n. The value is exact; very large results simply have many digits, so copy the whole string.