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.

A215684 Let p=prime=a(n); then a(n+1) = smallest prime q>p such that 2p+q and 2q+p are both primes.

Table of values

n a(n)
1 3
2 5
3 7
4 17
5 67
6 107
7 277
8 353
9 487
10 557
11 787
12 797
13 853
14 983
15 1033
16 1163
17 1597
18 1637
19 1657
20 1697
21 1867
22 1913
23 2347
24 2543
25 2833
26 2897
27 2953
28 2957
29 3343
30 3413
31 3607
32 3623
33 3643
34 3863
35 3907
36 4013
37 4447
38 4583
39 4987
40 5087
41 5113
42 5507
43 6277
44 6653
45 7027
46 7433
47 7603

List of values

[3, 5, 7, 17, 67, 107, 277, 353, 487, 557, 787, 797, 853, 983, 1033, 1163, 1597, 1637, 1657, 1697, 1867, 1913, 2347, 2543, 2833, 2897, 2953, 2957, 3343, 3413, 3607, 3623, 3643, 3863, 3907, 4013, 4447, 4583, 4987, 5087, 5113, 5507, 6277, 6653, 7027, 7433, 7603]