Tower of Hanoi: the optimal way to move an even number of disks from peg 0 to peg 2 or an odd number from peg 0 to peg 1 is on move n to move disk A001511 from peg A060571 (here) to peg A060572.

A060571

Tower of Hanoi: the optimal way to move an even number of disks from peg 0 to peg 2 or an odd number from peg 0 to peg 1 is on move n to move disk A001511 from peg A060571 (here) to peg A060572.

Terms

    a(0) =0a(1) =0a(2) =1a(3) =0a(4) =2a(5) =2a(6) =0a(7) =0a(8) =1a(9) =1a(10) =2a(11) =1a(12) =0a(13) =0a(14) =1a(15) =0a(16) =2a(17) =2a(18) =0a(19) =2a(20) =1a(21) =1a(22) =2a(23) =2a(24) =0a(25) =0a(26) =1a(27) =0a(28) =2a(29) =2

External references