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.

A057459 a(n+1) = smallest prime p in the range a(n) < p < a(1)*a(2)*...*a(n) such that p-1 divides a(1)*a(2)*...*a(n); or if no such prime p exists, then a(n+1) = smallest prime > a(n).

Table of values

n a(n)
1 2
2 3
3 5
4 7
5 11
6 23
7 31
8 43
9 47
10 67
11 71
12 139
13 211
14 283
15 311
16 331
17 431
18 463
19 659
20 683
21 691
22 863
23 947
24 967
25 1291
26 1303
27 1319
28 1367
29 1427
30 1699
31 1867
32 1979
33 1987
34 2011
35 2111
36 2131
37 2311
38 2531
39 3011
40 3083
41 4099
42 4423
43 4643
44 4691
45 4831
46 5171
47 5179
48 5683
49 5839

List of values

[2, 3, 5, 7, 11, 23, 31, 43, 47, 67, 71, 139, 211, 283, 311, 331, 431, 463, 659, 683, 691, 863, 947, 967, 1291, 1303, 1319, 1367, 1427, 1699, 1867, 1979, 1987, 2011, 2111, 2131, 2311, 2531, 3011, 3083, 4099, 4423, 4643, 4691, 4831, 5171, 5179, 5683, 5839]