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.

A305099 Least prime m such that either prime(n)# - m is prime or prime(n)# + m is prime, where p# denotes the product of all primes <= p.

Table of values

n a(n)
1 3
2 3
3 7
4 11
5 13
6 17
7 19
8 23
9 37
10 41
11 67
12 59
13 47
14 47
15 67
16 59
17 61
18 89
19 89
20 103
21 79
22 83
23 89
24 97
25 103
26 131
27 113
28 127
29 223
30 191
31 163
32 179
33 389
34 239
35 151
36 167
37 173
38 239
39 199
40 191
41 199
42 223
43 233
44 593
45 293
46 457
47 227
48 311
49 373
50 257
51 307
52 313
53 283
54 277
55 271
56 307
57 307

List of values

[3, 3, 7, 11, 13, 17, 19, 23, 37, 41, 67, 59, 47, 47, 67, 59, 61, 89, 89, 103, 79, 83, 89, 97, 103, 131, 113, 127, 223, 191, 163, 179, 389, 239, 151, 167, 173, 239, 199, 191, 199, 223, 233, 593, 293, 457, 227, 311, 373, 257, 307, 313, 283, 277, 271, 307, 307]

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

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