Hello, alyosha2!

Not sure what the question is . . .

It's the "Towers of Hanoi" algorithm in case that helps.

Consider the first few values of the sequence.

. . = number of disks, = number of moves.

. .

The recursive form is: .

. . The closed form is: .