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.

A060572 Tower of Hanoi: 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 is on move n to move disk A001511 from peg A060571 to peg A060572 (here).

Table of values

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

List of values

[1, 2, 2, 1, 0, 1, 1, 2, 2, 0, 0, 2, 1, 2, 2, 1, 0, 1, 1, 0, 2, 0, 0, 1, 1, 2, 2, 1, 0, 1, 1, 2, 2, 0, 0, 2, 1, 2, 2, 0, 0, 1, 1, 0, 2, 0, 0, 2, 1, 2, 2, 1, 0, 1, 1, 2, 2, 0, 0, 2, 1, 2, 2, 1, 0, 1, 1, 0, 2, 0, 0, 1, 1, 2, 2, 1, 0, 1, 1, 0, 2, 0, 0, 2, 1, 2, 2, 0, 0, 1, 1, 0, 2, 0, 0, 1, 1, 2, 2, 1, 0, 1, 1, 2, 2]