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.

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

Table of values

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

List of values

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