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

A183117

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

Terms

    a(0) =0a(1) =1a(2) =3a(3) =7a(4) =19a(5) =53a(6) =153a(7) =451a(8) =1339a(9) =3997a(10) =11961a(11) =35835a(12) =107435a(13) =322197a(14) =966425a(15) =2899027a(16) =8696699a(17) =26089517a(18) =78267673a(19) =234801675a(20) =704402987a(21) =2113205861a(22) =6339612857a(23) =19018831395a(24) =57056483259a(25) =171169433149a(26) =513508274169

External references