Tower of Hanoi: using 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, a(n) is the smallest disk on peg 2 after n moves (or 0 if there are no disks on peg 2).
A060575
Tower of Hanoi: using 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, a(n) is the smallest disk on peg 2 after n moves (or 0 if there are no disks on peg 2).
Terms
- a(0) =0a(1) =0a(2) =2a(3) =1a(4) =1a(5) =2a(6) =0a(7) =0a(8) =4a(9) =1a(10) =1a(11) =4a(12) =3a(13) =3a(14) =2a(15) =1a(16) =1a(17) =2a(18) =3a(19) =3a(20) =4a(21) =1a(22) =1a(23) =4a(24) =0a(25) =0a(26) =2a(27) =1a(28) =1a(29) =2
External references
- oeis: A060575