So my professor gave us this recurrence relation to prove combinatorially for extra credit, but I was unable to figure it out.
h(n) = 5h(n-1) - 6h(n-2) + 1
This was my solution, but I couldn't figure out how to factor in the +1:
Let hn be the number of ways to arrange 0,1,2,3,4 on a 1xn...