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.

A241857 Number of primes p less than prime(n)-1, such that adding prime(n)-1 and p in binary does not require any carry.

Table of values

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

List of values

[0, 0, 2, 0, 1, 2, 6, 2, 0, 2, 0, 5, 7, 2, 1, 3, 1, 2, 8, 2, 9, 1, 4, 5, 11, 5, 1, 2, 4, 6, 0, 14, 16, 7, 9, 3, 4, 6, 3, 6, 3, 5, 0, 18, 8, 2, 4, 0, 4, 5, 7, 1, 6, 1, 54, 10, 15, 5, 16, 18, 7, 14, 6, 3, 10, 5, 6, 16, 2, 4, 17, 2, 1, 6, 1, 0, 15, 8, 19, 10, 6, 9]