I'm given a growing list of a's and b's(size of a and b at the bottom) and had to form a recurrence equation for $a_{n}$ & $b_n$ (number of a's and b's respectively) and I was able to do it, these are what I got:
$a_n$=2$a_{n-1}$+$a_{n-2}$+$a_{n-3}$ and $b_n$=$b_{n-2}$+2$b_{n-3}$+3$b_{n-4}$
After doing this I needed to prove that $S_n$ = 2$S_{n-1}$+$S_{n-2}$, where $S_n$=$a_n$+$b_n$
However, when I tried solving for $S_n$, I get this:
$S_n$ = $S_{n-1}$+2$S_{n-2}$+2$S_{n-3}$+2$S_{n-4}$
When I try applying both of these $S_n$ they both get the correct answer, but idk how to simplify mine to be like the answer wanted
here are the numbers for as,bs etc
$a_0$=0, $a_1$=1, $a_2$=2, $a_3$=5 , $a_4$=13
and $b_0$=1, $b_1$=0, $b_2$=1, $b_3$=2, $b_4$=4
and $S_n$ being the sum of $a_n$ and $b_n$