Consider the sequence:

8, 11, 14, 17, 20, 23, 26,

write a recursive definition:

group of answer choices

latex: a_n=2\cdot a_{n-1}-5 a n = 2 ⋅ a n − 1 − 5

latex: a_n=3\cdot a_{n-1} a n = 3 ⋅ a n − 1

latex: a_n=3+a_{n-1} a n = 3 + a n − 1

latex: a_n=8+3\cdot a_{n-1}

a_n = 3 + a_n − 1 a_ n = 3 + a_ n − 1

Step-by-step explanation:

The first term is 8, so a_1 = 8

Each time we want a new term, we add on 3

8+3 = 11

11+3 = 14

14+3 = 17

17+3 = 20

23+3 = 26

and so on

This recursive step of adding on 3 to the prior term is written as this: an = 3+a_n-1 which says "to get the nth term, add 3 to the term just before the nth term"

l' jhl jje f id bid b e iueb v jhdvb vh ei uf djbduv evb                                                                                                                                   8gfdgsfhjk.,l/ uh   dv eb b