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.

A184907 Let S_n be the set of the integers having alternating bit sum equal to n. There are a(n) primes among the smallest 2n+1 numbers of S_n.

Table of values

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

List of values

[0, 1, 4, 0, 4, 7, 0, 4, 5, 0, 1, 6, 0, 9, 3, 0, 6, 5, 0, 8, 5, 0, 3, 2, 0, 6, 3, 0, 3, 9, 0, 5, 5, 0, 3, 6, 0, 5, 2, 0, 8, 6, 0, 8, 6, 0, 2, 12, 0, 8, 1, 0, 2, 7, 0, 2, 1, 0, 4, 5, 0, 7, 5, 0, 8, 6, 0, 7, 6, 0, 3, 9, 0, 4, 11, 0, 4, 5, 0, 5, 2]