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 1 after n moves (or 0 if there are no disks on peg 1).

A060574

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 1 after n moves (or 0 if there are no disks on peg 1).

Terms

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

External references