You can put this solution on YOUR website!
In subscript form, the recursive formula would be
Which says "The starting term is . To get the nth term , we need to multiply the previous term by -3."
In this case, n is some positive whole number (n > 0).
With function form, we have the same basic format just with different notation
The function form would be
where n > 0 is a whole number.
If we plug in n = 2 to get the second term, we get replace every n with 2 Replace f(1) with 2 (since is defined above)
and we get the proper second term, which is -6
If we plug in n = 3 to get the third term, we get replace every n with 3 Replace f(2) with -6 (since we just found above)
and we get the proper third term, which is 18
The rest of the terms are generated in this recursive fashion.