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 to peg A060572 (here).
A060572
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 to peg A060572 (here).
Terms
- a(0) =1a(1) =2a(2) =2a(3) =1a(4) =0a(5) =1a(6) =1a(7) =2a(8) =2a(9) =0a(10) =0a(11) =2a(12) =1a(13) =2a(14) =2a(15) =1a(16) =0a(17) =1a(18) =1a(19) =0a(20) =2a(21) =0a(22) =0a(23) =1a(24) =1a(25) =2a(26) =2a(27) =1a(28) =0a(29) =1
External references
- oeis: A060572