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.

A242247 Maximal k <= n^2 + 1 such that every Goldbach representation of 2*k = p+q contains at least one prime from the set {prime(1), prime(2), ..., prime(n)}, or a(n)=0 if there is no such k.

Table of values

n a(n)
1 2
2 4
3 8
4 10
5 14
6 22
7 22
8 28
9 32
10 38
11 46
12 49
13 49
14 58
15 58
16 68
17 74
18 74
19 82
20 82
21 87
22 94
23 94
24 98
25 112
26 116
27 121
28 128
29 136
30 146
31 146
32 146
33 155
34 155
35 164
36 166
37 184
38 184
39 184
40 200
41 206
42 206
43 221
44 221
45 224
46 238
47 244
48 265
49 265
50 268
51 268
52 268
53 286
54 286
55 286
56 286
57 344

List of values

[2, 4, 8, 10, 14, 22, 22, 28, 32, 38, 46, 49, 49, 58, 58, 68, 74, 74, 82, 82, 87, 94, 94, 98, 112, 116, 121, 128, 136, 146, 146, 146, 155, 155, 164, 166, 184, 184, 184, 200, 206, 206, 221, 221, 224, 238, 244, 265, 265, 268, 268, 268, 286, 286, 286, 286, 344]