Question

Consider the sequence: 8, 11, 14, 17, 20, 23, 26, ... Write a recursive definition.

A a n = 2 ⋅ a n − 1 − 5 a n = 2 ⋅ a n − 1 − 5

B a n = 3 ⋅ a n − 1 a n = 3 ⋅ a n − 1

C a n = 3 + a n − 1 a n = 3 + a n − 1

D a_n=8+3 an-1}

Answer 1

Answer: Anybody know the explicit definition to this sequence?

Explanation:

Answer 2

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:
`a_(n) = 3 + a_(n-1)` which says "to get the nth term, add 3 to the term just before the nth term"

Based on what you posted for your answer choices, the final answer is likely choice C. However it seems some weird typo happened.