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.

A184908 Let S_n be the set of the integers having alternating bit sum equal to -n. There are a(n) primes among the smallest 3n+5 odd numbers of S_n.

Table of values

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

List of values

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