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.

A118123 a(n) = number of k's such that prime(n+1) = prime(n) + (prime(n) mod k).

Table of values

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

List of values

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