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.

A118534 a(n) is the largest 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 9
6 9
7 15
8 15
9 17
10 27
11 25
12 33
13 39
14 39
15 41
16 47
17 57
18 55
19 63
20 69
21 67
22 75
23 77
24 81
25 93
26 99
27 99
28 105
29 105
30 99
31 123
32 125
33 135
34 129
35 147
36 145
37 151
38 159
39 161
40 167
41 177
42 171
43 189
44 189
45 195
46 187
47 199
48 219
49 225
50 225
51 227
52 237
53 231
54 245
55 251
56 257
57 267
58 265
59 273
60 279

List of values

[0, 0, 3, 0, 9, 9, 15, 15, 17, 27, 25, 33, 39, 39, 41, 47, 57, 55, 63, 69, 67, 75, 77, 81, 93, 99, 99, 105, 105, 99, 123, 125, 135, 129, 147, 145, 151, 159, 161, 167, 177, 171, 189, 189, 195, 187, 199, 219, 225, 225, 227, 237, 231, 245, 251, 257, 267, 265, 273, 279]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.