A060575 - cp's OEIS frontend

A060575 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 2 after n moves (or 0 if there are no disks on peg 2).

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

[0, 0, 2, 1, 1, 2, 0, 0, 4, 1, 1, 4, 3, 3, 2, 1, 1, 2, 3, 3, 4, 1, 1, 4, 0, 0, 2, 1, 1, 2, 0, 0, 6, 1, 1, 6, 3, 3, 2, 1, 1, 2, 3, 3, 6, 1, 1, 6, 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, 6, 1, 1, 6, 3, 3, 2, 1, 1, 2, 3, 3, 6, 1, 1, 6, 0, 0, 2, 1, 1, 2, 0, 0, 4]

cp's OEIS Frontend

A060575 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 2 after n moves (or 0 if there are no disks on peg 2).

Table of values

List of values

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

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

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