Which recursive formula can be used to generate the sequence shown, where f(1) = 5 and n > 1? 5,–1, –7, –13, –19, f(n + 1) = f(n) + 6 f(n) = f(n +1) – 6 f(n +1) = f(n) – 6 f(n +1) = –6f(n)

The given sequence is

5,–1, –7, –13, –19, ...

And here each current term is the sum of previous term  and -6. That is

It means

current term is the difference of previous term and 6, so we will get

Therefore the correct option is the third option .

its adding 5.5 each time

step-by-step explanation:

you have to wait a while to reward brainliest if only one person answers. if 2 people answer there should be a "mark brainliest" on their question.

i cant fully remember all of the ranks, here are the ones i remember.

hand, ambitous, ace, genius.