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.

A234387 a(n) = n-th smallest prime congruent to 1 modulo prime(n).

Table of values

n a(n)
1 3
2 13
3 41
4 113
5 331
6 443
7 613
8 1103
9 1013
10 1741
11 2543
12 3257
13 3691
14 4129
15 4889
16 6997
17 6491
18 8053
19 8443
20 12071
21 11681
22 12799
23 15439
24 18869
25 20759
26 21211
27 20807
28 27179
29 33791
30 28703
31 37339
32 39301
33 37813
34 53377
35 51853
36 54059
37 62801
38 60637
39 74149
40 72661
41 77687
42 62989
43 81749
44 79903
45 79589
46 109849
47 102547

List of values

[3, 13, 41, 113, 331, 443, 613, 1103, 1013, 1741, 2543, 3257, 3691, 4129, 4889, 6997, 6491, 8053, 8443, 12071, 11681, 12799, 15439, 18869, 20759, 21211, 20807, 27179, 33791, 28703, 37339, 39301, 37813, 53377, 51853, 54059, 62801, 60637, 74149, 72661, 77687, 62989, 81749, 79903, 79589, 109849, 102547]