Here is the problem:

Suppose a sequence is defined recursively be setting and and, for , requiring that .

Give a recursive algorithm for computing , where is a positive integer.

Using the initial conditions, I could calculate , etc., but that is not what the problem is asking for. I thought recursive definitions were when you set , but that makes the equation work with negative numbers. So, here I am, confused beyond belief with algorithms