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.

A133347 a(n) = smallest k such that prime(n+3) = 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 0
7 0
8 0
9 0
10 17
11 19
12 27
13 29
14 27
15 33
16 39
17 47
18 49
19 55
20 59
21 19
22 61
23 65
24 15
25 29
26 31
27 31
28 29
29 29
30 89
31 23
32 113
33 41
34 121
35 15
36 27
37 47
38 21
39 17
40 31
41 15
42 33
43 61
44 25
45 57
46 57
47 193
48 71
49 43
50 31
51 43
52 221
53 73
54 233
55 27
56 83
57 257
58 37
59 29
60 51
61 51
62 21
63 11
64 97
65 289
66 41
67 313
68 107
69 67

List of values

[0, 0, 0, 0, 0, 0, 0, 0, 0, 17, 19, 27, 29, 27, 33, 39, 47, 49, 55, 59, 19, 61, 65, 15, 29, 31, 31, 29, 29, 89, 23, 113, 41, 121, 15, 27, 47, 21, 17, 31, 15, 33, 61, 25, 57, 57, 193, 71, 43, 31, 43, 221, 73, 233, 27, 83, 257, 37, 29, 51, 51, 21, 11, 97, 289, 41, 313, 107, 67]