Solve the recurrence $h_{n+2} - 2h_{n+1} + h_n = {n \choose 2} + 2^n$ where $n \geq 0$, with initial values $h_0$ = 1 and $h_1$ = 1.
I tried solving this question by writing $h_{n+3}$ term as $h_{n+3} - 2h_{n+2} + h_{n+1} = {n+1 \choose 2} + 2^{n+1}$ and subtracted both the equations after multiplying the original equation by $2$ so that the $2^{n+1}$ term gets cancelled out. Now I am left with an expression which has all the terms $h_{n+3}, h_{n+2}, h_{n+1}, h_{n}$ on the LHS and a quadratic equation of $n$ on the RHS. I don't know how to proceed further so that I end up with an equation of $h_{n}$ only in terms of $n$.