Problem 6
Let A and E be opposite vertices of a regular octagon. A frog starts at A and jumps to an adjacent vertex until it reaches E and stops. If a_n counts paths of exactly n jumps ending at E, prove and for .
Step 5 of 5: Step 5
Detailed analysis
The initial values give and , yielding the stated formula.