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.

A003842 The infinite Fibonacci word: start with 1, repeatedly apply the morphism 1->12, 2->1, take limit; or, start with S(0)=2, S(1)=1, and for n>1 define S(n)=S(n-1)S(n-2), then the sequence is S(oo).

Table of values

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

List of values

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