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.

A026600 a(n) is the n-th letter of the infinite word generated from w(1)=1 inductively by w(n)=JUXTAPOSITION{w(n-1),w'(n-1),w"(n-1)}, where w(k) becomes w'(k) by the cyclic permutation 1->2->3->1 and w"(k) = (w')'(k).

Table of values

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

List of values

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