cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A210243 Hanoi solutions (odd), the disks are moved from pillar 1 to pillar 3. For disks = 2k+1 use the first 2^(2k+2)-2 number pairs.

Table of values

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

List of values

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

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.