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.

A118501 A variation on Flavius's sieves (A099204, A099243): Start with the Chen numbers; at the k-th sieving step, remove every p-th term of the sequence remaining after the (k-1)-st sieving step, where p is the k-th prime; iterate.

Table of values

n a(n)
1 2
2 5
3 17
4 23
5 53
6 83
7 127
8 167
9 181
10 211
11 281
12 347
13 449
14 467
15 499
16 509
17 641
18 677
19 821
20 887
21 941
22 953
23 1097
24 1193
25 1283
26 1327
27 1399
28 1471
29 1583
30 1721
31 1949
32 2029
33 2111
34 2213
35 2351
36 2381
37 2447
38 2549
39 2609
40 2777
41 3061
42 3137
43 3257
44 3307
45 3511
46 3539
47 3797

List of values

[2, 5, 17, 23, 53, 83, 127, 167, 181, 211, 281, 347, 449, 467, 499, 509, 641, 677, 821, 887, 941, 953, 1097, 1193, 1283, 1327, 1399, 1471, 1583, 1721, 1949, 2029, 2111, 2213, 2351, 2381, 2447, 2549, 2609, 2777, 3061, 3137, 3257, 3307, 3511, 3539, 3797]