cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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.

Table of values

n a(n)
1 1
2 2
3 1
4 3
5 1
6 2
7 4
8 5
9 1
10 2
11 1
12 3
13 1
14 5
15 4
16 3
17 1
18 2
19 1
20 3
21 1
22 2
23 4
24 5
25 1
26 2
27 4
28 3
29 1
30 5
31 4
32 5
33 1
34 2
35 1
36 3
37 1
38 2
39 4
40 5
41 1
42 2
43 1
44 3
45 1
46 5
47 4
48 3
49 1
50 2
51 1
52 3
53 1
54 5
55 4
56 5
57 1
58 2
59 4
60 3
61 1
62 5
63 4
64 3
65 1
66 2
67 1
68 3
69 1
70 2
71 4
72 5
73 1
74 2
75 1
76 3
77 1
78 5
79 4
80 3
81 1
82 2
83 1
84 3
85 1
86 2
87 4

List of values

[1, 2, 1, 3, 1, 2, 4, 5, 1, 2, 1, 3, 1, 5, 4, 3, 1, 2, 1, 3, 1, 2, 4, 5, 1, 2, 4, 3, 1, 5, 4, 5, 1, 2, 1, 3, 1, 2, 4, 5, 1, 2, 1, 3, 1, 5, 4, 3, 1, 2, 1, 3, 1, 5, 4, 5, 1, 2, 4, 3, 1, 5, 4, 3, 1, 2, 1, 3, 1, 2, 4, 5, 1, 2, 1, 3, 1, 5, 4, 3, 1, 2, 1, 3, 1, 2, 4]