Question 1180276
<br>
This is a recursively defined sequence, where each number is found from the preceding number based on a pattern.  The recursive definition<br>
f(n) = -2f(n-1) + 1<br>
means each term (f(n), term "n") is found by multiplying the previous term (f(n-1), the preceding term) by -2 and adding 1.<br>
Given: f(1)=3<br>
f(2)=-2*f(1)+1 = -2(3)+1 = -6+1 = -5
f(3)=-2*f(2)+1 = -2(-5)+1 = 10+1 = 11<br>
Continue using the pattern to find f(5).<br>