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.

A093702 a(n) = smallest prime p>a(n-1) such that n divides (p-1) and (p-1)/n > (a(n-1)-1)/(n-1), a(1) = 2.

Table of values

n a(n)
1 2
2 5
3 13
4 29
5 41
6 61
7 113
8 137
9 163
10 191
11 331
12 373
13 443
14 491
15 541
16 593
17 647
18 739
19 1103
20 1181
21 1303
22 1409
23 1657
24 1753
25 1901
26 2003
27 2161
28 2269
29 2437
30 2551
31 2729
32 3041
33 3169
34 3299
35 3571
36 3709
37 3923
38 4219
39 4447
40 4721
41 5003
42 5167
43 5333
44 5501
45 5851

List of values

[2, 5, 13, 29, 41, 61, 113, 137, 163, 191, 331, 373, 443, 491, 541, 593, 647, 739, 1103, 1181, 1303, 1409, 1657, 1753, 1901, 2003, 2161, 2269, 2437, 2551, 2729, 3041, 3169, 3299, 3571, 3709, 3923, 4219, 4447, 4721, 5003, 5167, 5333, 5501, 5851]