But at this point its not very useful. A 1 5. For a sequence a 1 a 2 a 3 a n a recursive formula is a formula that requires the computation of all previous terms in order to find the value of a n.
Warmup 1 Find f5 if fn n and f1 -2 n f 1 2 Write a recursive formula for.
From here you can just continue the pattern and it should be apparent that the following recursive formula is true. Then we have to figure out and include the common difference. State the initial term. An an - 1 6 where a1 4 an n2 where a1 1 an an - 1 9 where a1 4.