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.

A082410 a(1)=0. Thereafter, the sequence is constructed using the rule: for any k >= 0, if a(1), a(2), ..., a(2^k+1) are known, the next 2^k terms are given as follows: a(2^k+1+i) = 1 - a(2^k+1-i) for 1 <= i <= 2^k.

Table of values

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

List of values

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