|
| |
|
|
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.
|
|
0
| |
|
|
1, 2, 1, 3, 1, 2, 4, 5, 1, 2, 1, 3, 1, 5, 4, 3, 1, 2, 1, 3, 1, 2, 4, 5
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,2
|
|
|
REFERENCES
| A. M. Hinz, Squarefree Tower of Hanoi sequences, Enseign. Math. (2) 42(1996), 257-264.
A. M. Hinz, The Tower of Hanoi, in Algebras and combinatorics (Hong Kong, 1997), 277-289, Springer, Singapore, 1999.
|
|
|
CROSSREFS
| Sequence in context: A130212 A133737 A125047 * A036262 A169613 A176572
Adjacent sequences: A045895 A045896 A045897 * A045899 A045900 A045901
|
|
|
KEYWORD
| nonn,more
|
|
|
AUTHOR
| Andreas M. Hinz (hinz(AT)appl-math.tu-muenchen.de)
|
| |
|
|
