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.

A104107 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) = 0, A(k+1) = A(k),0,B(k) and c(k+1)= 2*c(k)+1 if a(k) = 1.

Table of values

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

List of values

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