Question

How do I do recurrence relations?

Answer 1

Any number in the sequence depends on the previous number.
Here's an example.
1,2,4,8,16,32,64
To figure out any number, double the previous number.

Answer 2

recursively; and the dependance on the "previous number" is not quite general

Answer 3

fibonacci is recursive, but relies on more thana previous number

Answer 4

id have to check to make sure if: an = n is recursive or not tho

Answer 5

as a function of the preceding terms .... so an = n is not a recurssion