I've been trying to find an answer for a question for some time, and I've done some Google searching but can't seem to figure out exactly how to solve it. It is a linear recursive sequence, and it should be written in a closed-form function.
Problem:
Find the closed form solution for $R_n = -R_{n-1} + 2R_{n-2}$ when $R_0=3$ and $R_1 = 2$
Any help?
Thanks.
$$ R_n + R_{n-1} - 2R_{n-2}=0 $$ Let $R_n = \alpha^n$, then $$\alpha^2 + \alpha - 2 = 0 \implies \alpha = 1 \text{ or } -2$$
$R_n = A + B\cdot(-2)^n$
Plug in $R_0=3, R_1=2$: $$ A+B=3 \\A-2B=2$$
Then the desired closed form is $$ R_n = \frac{8}{3} + \frac{1}{3} (-2)^n $$