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.

A133346 a(n) = smallest k such that prime(n+2) = prime(n) + (prime(n) mod k), or 0 if no such k exists.

Table of values

n a(n)
1 0
2 0
3 0
4 0
5 0
6 7
7 11
8 0
9 15
10 21
11 21
12 31
13 7
14 11
15 35
16 9
17 17
18 17
19 61
20 9
21 21
22 23
23 23
24 77
25 7
26 19
27 97
28 101
29 91
30 19
31 13
32 41
33 25
34 127
35 47
36 139
37 21
38 17
39 31
40 11
41 167
42 13
43 37
44 11
45 61
46 25
47 39
48 7
49 13
50 73
51 9
52 227
53 25
54 239
55 35
56 15
57 9
58 29
59 271
60 269
61 37
62 25
63 7
64 61
65 59
66 27
67 21
68 13
69 11
70 113
71 113

List of values

[0, 0, 0, 0, 0, 7, 11, 0, 15, 21, 21, 31, 7, 11, 35, 9, 17, 17, 61, 9, 21, 23, 23, 77, 7, 19, 97, 101, 91, 19, 13, 41, 25, 127, 47, 139, 21, 17, 31, 11, 167, 13, 37, 11, 61, 25, 39, 7, 13, 73, 9, 227, 25, 239, 35, 15, 9, 29, 271, 269, 37, 25, 7, 61, 59, 27, 21, 13, 11, 113, 113]