Which recursive formula can be used to generate the sequence below, where f(1) = 6 and n ≥ 1?
6, 1, –4, –9, –14, …
f (n + 1) = f(n) + 5
f (n + 1) = f(n) – 5
f (n) = f(n + 1 ) – 5
f (n + 1) = –5f(n)

the answer is 0.3175 hope that you ^w^

also you might actually want to put this picture up if you want people to solve it luckily i remember this question

answer: kljdcdhjbdlchjad oac apoich a

step-by-step explanation:

it’s the first one your welcome

this may not be at all, but i use the same website you're using for school, and if i'm stuck doing one of these i try to look for it on the section.