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.

A104104 a(1) = 1, if A(k) = sequence of first 2^(k-1) terms and if B(k) is A(k) with 0's and 1's exchanged, then A(k+1) = A(k)A(k) if a(k) = 0, A(k+1) = A(k)B(k) if a(k) = 1.

Table of values

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

List of values

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