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.

A114483 s(1)={1}. s(2)={1,0}. If a(n) = 0, s(n+2) = s(n+1) U s(n) U {1}. If a(n) = 1, s(n+2) = s(n+1) U s(n+1) U {1}. (U represents concatenation of finite sequences.) {a(n)} is the limit of {s(n)} as n -> infinity.

Table of values

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

List of values

[1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1]