Minimal number of moves for the cyclic variant of the Towers of Hanoi for 3 pegs and n disks, with the final peg two steps away.

A005666

Minimal number of moves for the cyclic variant of the Towers of Hanoi for 3 pegs and n disks, with the final peg two steps away.

Terms

    a(0) =0a(1) =2a(2) =7a(3) =21a(4) =59a(5) =163a(6) =447a(7) =1223a(8) =3343a(9) =9135a(10) =24959a(11) =68191a(12) =186303a(13) =508991a(14) =1390591a(15) =3799167a(16) =10379519a(17) =28357375a(18) =77473791a(19) =211662335a(20) =578272255a(21) =1579869183a(22) =4316282879a(23) =11792304127a(24) =32217174015a(25) =88018956287a(26) =240472260607a(27) =656982433791

External references