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.

A114232 n(k) is the minimum number of n that need at least another number of k to make Prime[n]+2*Prime[n-k]a prime.

Table of values

n a(n)
1 2
2 10
3 5
4 14
5 22
6 35
7 41
8 26
9 17
10 92
11 170
12 79
13 190
14 43
15 164
16 240
17 175
18 590
19 94
20 236
21 446
22 1004
23 279
24 920
25 409
26 971
27 646
28 1088
29 502
30 449
31 1219
32 1263
33 2049
34 1541
35 2191
36 915
37 3727
38 1886
39 1394
40 4506
41 5014
42 1524
43 1181
44 6323
45 888
46 3995
47 4033
48 6625
49 9664
50 13733

List of values

[2, 10, 5, 14, 22, 35, 41, 26, 17, 92, 170, 79, 190, 43, 164, 240, 175, 590, 94, 236, 446, 1004, 279, 920, 409, 971, 646, 1088, 502, 449, 1219, 1263, 2049, 1541, 2191, 915, 3727, 1886, 1394, 4506, 5014, 1524, 1181, 6323, 888, 3995, 4033, 6625, 9664, 13733]