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.

A217884 Let c(m)=prime(m), m=1,2,3,4. For m>=5, suppose that c(m)/e is in the interval [c(k),c(k+1)). Then let c(m+1)=e*c(k+1) if e*c(k+1) < prime(m+1), and otherwise let c(m+1) = prime(m+1). Then a(n) is the n-th prime in {c(m)}.

Table of values

n a(n)
1 2
2 3
3 5
4 7
5 13
6 19
7 31
8 43
9 47
10 67
11 71
12 73
13 79
14 83
15 103
16 107
17 109
18 113
19 137
20 139
21 157
22 163
23 173
24 179
25 181
26 197
27 211
28 229
29 239
30 241
31 251
32 257
33 269
34 271
35 283
36 313
37 317
38 337
39 347
40 353
41 359
42 367
43 397
44 401
45 409
46 419

List of values

[2, 3, 5, 7, 13, 19, 31, 43, 47, 67, 71, 73, 79, 83, 103, 107, 109, 113, 137, 139, 157, 163, 173, 179, 181, 197, 211, 229, 239, 241, 251, 257, 269, 271, 283, 313, 317, 337, 347, 353, 359, 367, 397, 401, 409, 419]