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.

A371694 a(1) = 2; a(n+1) is the larger prime between nextprime(a(n)) and prevprime(a(n)+n-m+1), where m is the number of primes < a(n) that are missing from the sequence.

Table of values

n a(n)
1 2
2 3
3 5
4 7
5 11
6 13
7 19
8 23
9 29
10 37
11 43
12 47
13 53
14 61
15 71
16 79
17 89
18 97
19 107
20 113
21 127
22 137
23 139
24 151
25 163
26 173
27 181
28 193
29 199
30 211
31 223
32 233
33 241
34 251
35 263
36 277
37 283
38 293
39 307
40 317
41 331
42 337
43 353
44 367
45 379
46 389
47 401
48 409
49 421
50 433
51 449
52 463
53 467
54 479
55 491
56 503

List of values

[2, 3, 5, 7, 11, 13, 19, 23, 29, 37, 43, 47, 53, 61, 71, 79, 89, 97, 107, 113, 127, 137, 139, 151, 163, 173, 181, 193, 199, 211, 223, 233, 241, 251, 263, 277, 283, 293, 307, 317, 331, 337, 353, 367, 379, 389, 401, 409, 421, 433, 449, 463, 467, 479, 491, 503]