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.

A348511 Numbers k for which 2k+1 can be obtained with successive prime shifts towards larger primes (by iterating A003961, starting from k).

Table of values

n a(n)
1 2
2 3
3 4
4 5
5 10
6 11
7 23
8 29
9 41
10 53
11 57
12 83
13 89
14 113
15 131
16 173
17 179
18 191
19 233
20 239
21 251
22 281
23 293
24 359
25 419
26 431
27 443
28 491
29 509
30 593
31 641
32 653
33 659
34 683
35 719
36 743
37 761
38 809
39 911
40 953
41 1013
42 1019
43 1031
44 1049
45 1054
46 1103
47 1223
48 1229
49 1289
50 1409
51 1439
52 1451
53 1481
54 1499
55 1511
56 1559
57 1583
58 1601
59 1733
60 1811
61 1889
62 1901
63 1931

List of values

[2, 3, 4, 5, 10, 11, 23, 29, 41, 53, 57, 83, 89, 113, 131, 173, 179, 191, 233, 239, 251, 281, 293, 359, 419, 431, 443, 491, 509, 593, 641, 653, 659, 683, 719, 743, 761, 809, 911, 953, 1013, 1019, 1031, 1049, 1054, 1103, 1223, 1229, 1289, 1409, 1439, 1451, 1481, 1499, 1511, 1559, 1583, 1601, 1733, 1811, 1889, 1901, 1931]