A060573 - cp's OEIS frontend

A060573 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 0 after n moves.

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

[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, 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, 8, 1, 1, 8, 3, 3, 2, 1, 1, 2, 3, 3, 8, 1, 1, 8, 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]

cp's OEIS Frontend

A060573 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 0 after n moves.

Table of values

List of values

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

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

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