Magnetic Tower of Hanoi, number of moves of disk number k, optimally solving the [RED ; BLUE ; NEUTRAL] or [NEUTRAL ; RED ; BLUE] pre-colored puzzle.

A183111

Magnetic Tower of Hanoi, number of moves of disk number k, optimally solving the [RED ; BLUE ; NEUTRAL] or [NEUTRAL ; RED ; BLUE] pre-colored puzzle.

Terms

    a(0) =0a(1) =1a(2) =3a(3) =9a(4) =25a(5) =75a(6) =223a(7) =665a(8) =1993a(9) =5971a(10) =17903a(11) =53697a(12) =161065a(13) =483163a(14) =1449439a(15) =4348233a(16) =13044585a(17) =39133571a(18) =117400431a(19) =352200881a(20) =1056601993a(21) =3169805003a(22) =9509413535a(23) =28528238329a(24) =85584711561a(25) =256754129459a(26) =770262380399

External references