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.

A110471 Prime analog of Baum-Sweet sequence: a(n) = 1 if binary representation of n contains no block of consecutive zeros of exactly prime length; otherwise a(n) = 0.

Table of values

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

List of values

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