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.

A358573 a(n) = smallest prime p such that q, r and s are all prime, where q = p + 2*(2*n + 1), r = (p - 2*n - 1)/2, and s = (q + 2*n + 1)/2.

Table of values

n a(n)
0 11
1 13
2 19
3 17
4 19
5 229
6 47
7 29
8 163
9 29
10 31
11 37
12 47
13 53
14 1231
15 41
16 43
17 61
18 83
19 61
20 439
21 1217
22 59
23 73
24 59
25 61
26 67
27 89
28 83
29 541
30 71
31 73
32 103
33 593
34 271
35 349
36 83
37 89
38 103
39 461
40 239
41 97
42 107
43 97
44 211
45 149
46 107
47 229
48 263
49 181
50 499
51 317
52 139
53 1453
54 131
55 809
56 127
57 137
58 163

List of values

[11, 13, 19, 17, 19, 229, 47, 29, 163, 29, 31, 37, 47, 53, 1231, 41, 43, 61, 83, 61, 439, 1217, 59, 73, 59, 61, 67, 89, 83, 541, 71, 73, 103, 593, 271, 349, 83, 89, 103, 461, 239, 97, 107, 97, 211, 149, 107, 229, 263, 181, 499, 317, 139, 1453, 131, 809, 127, 137, 163]