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.

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

Table of values

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

List of values

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