A101608 - cp's OEIS frontend

A101608 Solution to Tower of Hanoi puzzle encoded in pairs with the moves (1,2),(2,3),(3,1),(2,1),(3,2),(1,3). The disks are moved from peg 1 to 2. For a tower of k disks use the first 2^k-1 number pairs.

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

[1, 2, 1, 3, 2, 3, 1, 2, 3, 1, 3, 2, 1, 2, 1, 3, 2, 3, 2, 1, 3, 1, 2, 3, 1, 2, 1, 3, 2, 3, 1, 2, 3, 1, 3, 2, 1, 2, 3, 1, 2, 3, 2, 1, 3, 1, 3, 2, 1, 2, 1, 3, 2, 3, 1, 2, 3, 1, 3, 2, 1, 2, 1, 3, 2, 3, 2, 1, 3, 1, 2, 3, 1, 2, 1, 3, 2, 3, 2, 1, 3, 1, 3, 2, 1, 2, 3, 1, 2, 3, 2, 1, 3, 1, 2, 3, 1, 2, 1, 3, 2, 3]

cp's OEIS Frontend

A101608 Solution to Tower of Hanoi puzzle encoded in pairs with the moves (1,2),(2,3),(3,1),(2,1),(3,2),(1,3). The disks are moved from peg 1 to 2. For a tower of k disks use the first 2^k-1 number pairs.

Table of values

List of values

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

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

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