I was looking into a recurrence relation related to the Tower of Hanoi and how many times a particular $a,b,c$ appears where $a$ disks are on the left peg, $b$ disks are on the middle peg, and $c$ disks are on the right peg, with the final tower on the right peg for all $n=a+b+c$.
The recurrence relation I found is as follows $$f(a,b,c) = f(a-1,c,b) + f(c-1,a,b)$$ with base case $$f(k,0,0) = f(0,0,k) = 1$$$$f(0,k,0)=0$$$$f(a,b,c)=0,\ \text{any of}\ a,b,c\ \text{negative}$$
I've been reading through Generatingfunctionology by Herbert S. Wilf, but I don't think this kind argument swapping appears in the book.
I've gotten as far as $$F(x,y,z) = \sum f(a,b,c) x^a y^b z^c$$ $$F(x,y,z) = xF(x,z,y) + zF(z,x,y)$$ and hit a brick wall.
Any suggestions welcome.