A060571 - cp's OEIS frontend

A060571 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 (here) to peg A060572.

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

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

cp's OEIS Frontend

A060571 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 (here) to peg A060572.

Table of values

List of values

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

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

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