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.

A352942 Let p = prime(n); a(n) = number of primes q with same number of binary digits as p that can be obtained from p by changing one binary digit.

Table of values

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

List of values

[1, 1, 1, 1, 0, 0, 1, 2, 2, 1, 2, 1, 1, 3, 1, 2, 1, 1, 2, 3, 1, 1, 1, 1, 2, 3, 2, 0, 1, 1, 0, 2, 1, 2, 3, 1, 1, 4, 1, 0, 1, 1, 0, 1, 3, 1, 0, 0, 1, 1, 0, 0, 0, 0, 0, 1, 2, 2, 0, 3, 2, 1, 1, 2, 2, 1, 1, 0, 3, 0, 0, 2, 2, 0, 2, 2, 2, 3, 2, 2, 0, 2, 0, 1, 2, 0, 1]