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

A183112

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

Terms

    a(0) =0a(1) =1a(2) =4a(3) =13a(4) =38a(5) =113a(6) =336a(7) =1001a(8) =2994a(9) =8965a(10) =26868a(11) =80565a(12) =241630a(13) =724793a(14) =2174232a(15) =6522465a(16) =19567050a(17) =58700621a(18) =176101052a(19) =528301933a(20) =1584903926a(21) =4754708929a(22) =14264122464a(23) =42792360793a(24) =128377072354a(25) =385131201813

External references