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.

A114237 n(k) is the minimum n that requires at least k to make 2*Prime[n]+Prime[n-k] a prime.

Table of values

n a(n)
1 3
2 12
3 9
4 10
5 8
6 17
7 97
8 20
9 57
10 50
11 30
12 56
13 207
14 171
15 210
16 134
17 303
18 127
19 121
20 275
21 376
22 278
23 299
24 413
25 432
26 251
27 746
28 949
29 389
30 742
31 725
32 1790
33 1375
34 3605
35 783
36 1812
37 895
38 1257
39 2079
40 2962
41 4799
42 3456
43 6356
44 1701
45 5255
46 4669
47 5011
48 7164
49 3012
50 8361
51 11210

List of values

[3, 12, 9, 10, 8, 17, 97, 20, 57, 50, 30, 56, 207, 171, 210, 134, 303, 127, 121, 275, 376, 278, 299, 413, 432, 251, 746, 949, 389, 742, 725, 1790, 1375, 3605, 783, 1812, 895, 1257, 2079, 2962, 4799, 3456, 6356, 1701, 5255, 4669, 5011, 7164, 3012, 8361, 11210]