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.

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

Table of values

n a(n)
2 3
3 11
4 5
5 47
6 17
7 106
8 64
9 157
10 133
11 26
12 236
13 308
14 72
15 496
16 122
17 207
18 152
19 142
20 197
21 259
22 514
23 497
24 1266
25 1482
26 2005
27 2193
28 1380
29 964
30 3662
31 534
32 4055
33 667
34 2513
35 6083
36 1794
37 689
38 3332
39 5771
40 3713
41 4587
42 3450
43 12520
44 5712
45 3242
46 10252
47 18663
48 11912
49 25124

List of values

[3, 11, 5, 47, 17, 106, 64, 157, 133, 26, 236, 308, 72, 496, 122, 207, 152, 142, 197, 259, 514, 497, 1266, 1482, 2005, 2193, 1380, 964, 3662, 534, 4055, 667, 2513, 6083, 1794, 689, 3332, 5771, 3713, 4587, 3450, 12520, 5712, 3242, 10252, 18663, 11912, 25124]