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.

A166968 Minimum k such that for all m >= k there is a prime p with m < p < m * (n+1)/n.

Table of values

n a(n)
1 2
2 8
3 9
4 24
5 25
6 32
7 33
8 48
9 115
10 116
11 117
12 118
13 118
14 140
15 140
16 141
17 200
18 212
19 212
20 213
21 294
22 294
23 318
24 318
25 319
26 319
27 320
28 320
29 320
30 524
31 525
32 525
33 526
34 526
35 526
36 527
37 527
38 528
39 528
40 1328
41 1329
42 1330
43 1331
44 1331
45 1332
46 1333
47 1333
48 1334
49 1334
50 1335
51 1335

List of values

[2, 8, 9, 24, 25, 32, 33, 48, 115, 116, 117, 118, 118, 140, 140, 141, 200, 212, 212, 213, 294, 294, 318, 318, 319, 319, 320, 320, 320, 524, 525, 525, 526, 526, 526, 527, 527, 528, 528, 1328, 1329, 1330, 1331, 1331, 1332, 1333, 1333, 1334, 1334, 1335, 1335]