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

A183113

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

Terms

    a(0) =0a(1) =1a(2) =3a(3) =7a(4) =21a(5) =61a(6) =179a(7) =535a(8) =1597a(9) =4781a(10) =14331a(11) =42967a(12) =128869a(13) =386557a(14) =1159587a(15) =3478647a(16) =10435757a(17) =31306989a(18) =93920555a(19) =281761015a(20) =845282069a(21) =2535844733a(22) =7607531923a(23) =22822592343a(24) =68467771805a(25) =205403307437a(26) =616209910235

External references