From charlesreid1

Revision as of 22:54, 16 July 2017 by Admin (talk | contribs)




The Lucas numbers are closely related to the Fibonacci numbers, using the same recurrence relation but with different initial conditions.

$ L(n) = L(n-1) + L(n-2) \qquad L(0) = 2, L(1) = 1 $

Compare to the original Fibonacci sequence:

$ F(n) = F(n-1) + F(n-2) \qquad F(0) = 2, F(1) = 1 $