a(n) = one of five triples of directions in n-th triple of moves in the optimal solution of the Tower of Hanoi; it is a squarefree sequence over a five-letter alphabet.

A045898

a(n) = one of five triples of directions in n-th triple of moves in the optimal solution of the Tower of Hanoi; it is a squarefree sequence over a five-letter alphabet.

Terms

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

External references