The Fibonacci Sequence is 1,1,2,3,5,8,13, and so on
Another sequence called the Lucas Numbers sequence is 1,3,4,7,11,18,29...
You will notice that the patterns are very similar
Problem: Express the Lucas Numbers in terms of the sums of the Fibonacci
numbers as a recursive function L(n) where n is the nth number in a sequence