In fact the exact same reasoning can be used to derive the closed form expression for the Fibonacci numbers [2], which are defined by a recurrence relation similar to the one in the OP. You raise the corresponding 2x2 matrix to the nth power by going to the eigenbasis where the matrix becomes diagonal, raising the values on the diagonal (which turn out to be the golden ratio (phi) and -1/phi) to the nth power, then changing the basis back.
[1] http://en.wikipedia.org/wiki/Exponentiation_by_squaring
[2] http://en.wikipedia.org/wiki/Fibonacci_number#Closed-form_ex...
Also, you generalized the principle (and fused two exercises of the book in one :), or at least I'll have to believe you ;) I didn't form really much of an intuition on eigenvectors during the completely proper Linear Algebra course that I took, which is only my fault.
But I think that the exercise serves to reinforce the underlying theme that with enough attention, one can either supply or draw the insight to chip away yet one more part of the problem, to attack it from another angle, to pull it from just another direction that one had not seen before. It celebrates cleverness and knowledge, used to make complex things simple, to find the easy way out the hard way and end up better in the end, and that's partly why it's so cherished, but we all know that.
A bit OT.
I got tired of clicking on the footnote links, and click to come back to text, and wrote a little Greasemonkey script that shows the footnotes on mouse hover. Makes reading the text a bit easier.
It's available at http://userscripts.org/scripts/show/109690 in case anyone's interested.
Step 1: Transform to the eigenbasis of your operator. Step 2: Enjoy the beaty.
->LOOP:
7fff3dcfffd0 movaps xmm4, xmm5
7fff3dcfffd3 movaps xmm5, xmm6
7fff3dcfffd6 movaps xmm6, xmm7
7fff3dcfffd9 movaps xmm7, xmm4
7fff3dcfffdc movaps xmm4, xmm7
7fff3dcfffdf addsd xmm4, xmm4
7fff3dcfffe3 addsd xmm4, xmm5
7fff3dcfffe7 mulsd xmm6, xmm0
7fff3dcfffeb addsd xmm6, xmm4
7fff3dcfffef add ebp, +0x01
7fff3dcffff2 cmp ebp, eax
7fff3dcffff4 jle 0x7fff3dcfffd0 ->LOOP
I guess beauty is in the eye of the beholder. A simpler way to analyze this problem is noticing the f(n-3) term implies your function has to memorize up to 3 previous results. Then just use the coefficients from the formula to cycle the next result into memory. Using algebra and generating new coefficients as per the OP's solution is unnecessary.