I did not have an issue with the topic when it was relatively straight forward in that it gave f(0) and then wanted f(1),f(2),f(3)....

The problem arose when they gave f(0) and f(1) and wanted f(2),f(3),f(4),f(5)...

I'm going to pick a non homework portion of the problem:

Find f(2),f(3),f(4),F(5) if f is defined recursively by f(0)=f(1)=1 and for n=1,2,..

With f(n+1)=f(n)f(n-1)

Thanks for any help.