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