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.

A117078 a(n) is the smallest k such that prime(n+1) = prime(n) + (prime(n) mod k), or 0 if no such k exists.

Table of values

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

List of values

[0, 0, 3, 0, 3, 9, 3, 5, 17, 3, 25, 11, 3, 13, 41, 47, 3, 11, 7, 3, 67, 5, 7, 9, 31, 3, 9, 3, 5, 33, 41, 25, 3, 43, 3, 29, 151, 53, 7, 167, 3, 19, 3, 7, 3, 17, 199, 73, 3, 5, 227, 3, 11, 7, 251, 257, 3, 53, 7, 3, 13, 31, 101, 3, 103, 101, 13, 109, 3, 5, 347, 9, 19, 367, 5, 13, 127, 131, 131, 19, 3]