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.

A104177 A variation on Flavius's sieve (A000960): Start with the natural numbers; at the k-th sieving step, remove every f-th term of the sequence remaining after the (k-1)-st sieving step, where f is the (k+2)-nd Fibonacci number, f=F(k+2); iterate.

Table of values

n a(n)
1 1
2 3
3 7
4 9
5 15
6 19
7 21
8 31
9 33
10 37
11 39
12 45
13 51
14 61
15 63
16 67
17 69
18 75
19 79
20 81
21 93
22 97
23 99
24 109
25 111
26 121
27 123
28 127
29 129
30 135
31 139
32 141
33 151
34 157
35 165
36 169
37 171
38 181
39 183
40 189
41 195
42 199
43 201
44 211
45 213
46 219
47 225
48 229
49 231
50 241
51 243
52 247
53 249
54 255
55 261
56 271
57 277
58 279

List of values

[1, 3, 7, 9, 15, 19, 21, 31, 33, 37, 39, 45, 51, 61, 63, 67, 69, 75, 79, 81, 93, 97, 99, 109, 111, 121, 123, 127, 129, 135, 139, 141, 151, 157, 165, 169, 171, 181, 183, 189, 195, 199, 201, 211, 213, 219, 225, 229, 231, 241, 243, 247, 249, 255, 261, 271, 277, 279]