Which function gives the correct recursive formula for the sequence?
9, 13, 17, 21, 25, 29
Responses
a1 = 4; an = an −1 +9
a1 = 4; an = an −1 +9
a1 = 13; an = a9 + 9
a1 = 13; an = a9 + 9
a1 = 9; an = an −1 +4
a1 = 9; an = an −1 +4
a1 = 9; an = an −1 + 13
a1 = 9; an = an −1 + 13
The correct recursive formula for the sequence 9, 13, 17, 21, 25, 29 is:
a1 = 9; an = an-1 + 4
The correct recursive formula for the given sequence is:
a1 = 9; an = an - 1 + 4
To determine the correct recursive formula, we need to analyze the pattern in the sequence. Looking at the numbers, we can observe that each term in the sequence is obtained by adding 4 to the previous term.
So, we start with the first term a1, which is 9. Then, to obtain the next term a2, we add 4 to a1: a2 = a1 + 4 = 9 + 4 = 13. Similarly, to find a3, we add 4 to a2, and so on. This recursive pattern continues for all the terms in the sequence.
Therefore, the correct recursive formula for the sequence is:
a1 = 9; an = an - 1 + 4