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.

A075321 Pair the odd primes so that the n-th pair is (p, p+2n) where p is the smallest prime not included earlier such that p and p+2n are primes and p+2n also does not occur earlier: (3, 5), (7, 11), (13, 19), (23, 31), (37, 47), (17, 29), (53, 67) ... This is the sequence of the first member of every pair.

Table of values

n a(n)
1 3
2 7
3 13
4 23
5 37
6 17
7 53
8 43
9 61
10 83
11 109
12 73
13 101
14 139
15 41
16 149
17 157
18 137
19 113
20 193
21 197
22 179
23 211
24 229
25 263
26 199
27 227
28 107
29 331
30 293
31 311
32 283
33 241
34 269
35 349
36 359
37 383
38 367
39 401
40 317
41 379
42 439
43 491
44 421
45 409
46 449
47 463
48 467

List of values

[3, 7, 13, 23, 37, 17, 53, 43, 61, 83, 109, 73, 101, 139, 41, 149, 157, 137, 113, 193, 197, 179, 211, 229, 263, 199, 227, 107, 331, 293, 311, 283, 241, 269, 349, 359, 383, 367, 401, 317, 379, 439, 491, 421, 409, 449, 463, 467]