posted 5 years ago
What is your question? Can't you create a dictionary((0,1), (1, x[0]), and calculate the function values for n = 2 to whatever, using the dictionary and the given recursion , updating the dictionary as you go?
There are three kinds of actuaries: those who can count, and those who can't.