0
Background
Most everyone is familiar with the Fibonacci numbers F(n):
0, 1, 1, 2, 3, 5, 8, 13, 21 ...
These are formed by the recursion function F(n) = F(n-1) + F(n-2) with F(0)=0 and F(1)=1. A000045
A closely related sequence is the Lucas numbers L(m):
2, 1, 3, 4, 7, 11, 18, 29 ...
...