Question

Generate the first 5 terms of this sequence:

f(1) = 0 and f(2) = 1, f(n) = f(n - 1) + f(n - 2), for n > 2.

0, -1, 1, 0, 2

0, 1, 1, 2, 3

0, 1, 2, 2, 3

0, 1, 1, 2, 2

Answer 1

recursive, right?

Answer 2

yes its recursive, each term is the sum of the previous two
this is also known as the famous fibinocci sequence

http://en.wikipedia.org/wiki/Fibonocci_sequence