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.

A262775 For a(n+1), sift out all numbers congruent to a(n-1) mod a(n) except for a(n-1); a(0)=0, a(1)=2.

Table of values

n a(n)
0 0
1 2
2 3
3 7
4 9
5 13
6 15
7 19
8 21
9 27
10 33
11 37
12 39
13 49
14 51
15 55
16 57
17 63
18 67
19 69
20 81
21 85
22 99
23 105
24 109
25 111
26 117
27 121
28 123
29 127
30 135
31 141
32 147
33 153
34 175
35 177
36 189
37 195
38 201
39 207
40 211
41 219
42 247
43 249
44 261
45 265
46 267
47 273
48 279
49 285
50 289
51 301
52 303
53 307
54 315
55 327
56 337

List of values

[0, 2, 3, 7, 9, 13, 15, 19, 21, 27, 33, 37, 39, 49, 51, 55, 57, 63, 67, 69, 81, 85, 99, 105, 109, 111, 117, 121, 123, 127, 135, 141, 147, 153, 175, 177, 189, 195, 201, 207, 211, 219, 247, 249, 261, 265, 267, 273, 279, 285, 289, 301, 303, 307, 315, 327, 337]