In Proof by Induction - Sequence of integers the sequence of integers $a_1$, $a_2$, ... is defined as:
$$a_1 = 3$$ $$a_2 = 6$$ $$a_n = 5a_{n-1} - 6a_{n-2} + 2$$ for all $n\ge3$
And the question is posed of proving that $a_n = 1 + 2^{n-1} + 3^{n-1}$ for all $n\in\mathbb N$.
The base case and inductive hypothesis are clear to me, and in the inductive step I end up with:
$$a_{k+1} = 5a_k - 6a_{k-1} + 2$$
This, assuming the inductive hypothesis holds of $a_{k+1}$ and $a_{k}$, is equal to
$$5(1 + 2^{k-1} + 3^{k-1}) - 6(1 + 2^{k-2} + 3^{k-2}) + 2$$
From this, I arrive at $(5 + 25^{k -1}) - (6 + 20^{k -2}) + 2 = 5(1 + 5^{k -1}) - 2(3 + 10^{k -2}) + 2$, but I am unable to see how this is equivalent to $a_{k + 1} = 1 + 2^{k} + 3^{k}$.
Can anyone help me here?