A060574 - cp's OEIS frontend

A060574 Tower of Hanoi: using 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, a(n) is the smallest disk on peg 1 after n moves (or 0 if there are no disks on peg 1).

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

[0, 1, 1, 0, 3, 3, 2, 1, 1, 2, 3, 3, 0, 1, 1, 0, 5, 5, 2, 1, 1, 2, 5, 5, 4, 1, 1, 4, 3, 3, 2, 1, 1, 2, 3, 3, 4, 1, 1, 4, 5, 5, 2, 1, 1, 2, 5, 5, 0, 1, 1, 0, 3, 3, 2, 1, 1, 2, 3, 3, 0, 1, 1, 0, 7, 7, 2, 1, 1, 2, 7, 7, 4, 1, 1, 4, 3, 3, 2, 1, 1, 2, 3, 3, 4, 1, 1, 4, 7, 7, 2, 1, 1, 2, 7, 7, 6, 1, 1, 6, 3, 3, 2, 1, 1]

cp's OEIS Frontend

A060574 Tower of Hanoi: using 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, a(n) is the smallest disk on peg 1 after n moves (or 0 if there are no disks on peg 1).

Table of values

List of values

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

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

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