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.

A341864 Least increasing sequence of primes a(n) == A020652(n) (mod A038567(n)).

Table of values

n a(n)
1 3
2 7
3 11
4 13
5 19
6 31
7 37
8 43
9 59
10 61
11 71
12 113
13 149
14 157
15 179
16 229
17 251
18 257
19 283
20 293
21 311
22 379
23 389
24 409
25 419
26 421
27 431
28 461
29 463
30 467
31 479
32 617
33 673
34 751
35 829
36 863
37 919
38 953
39 1009
40 1021
41 1033
42 1069
43 1097
44 1123
45 1151
46 1171
47 1237
48 1277
49 1291
50 1409
51 1423
52 1489
53 1607
54 1621
55 1973
56 1987
57 2027
58 2087

List of values

[3, 7, 11, 13, 19, 31, 37, 43, 59, 61, 71, 113, 149, 157, 179, 229, 251, 257, 283, 293, 311, 379, 389, 409, 419, 421, 431, 461, 463, 467, 479, 617, 673, 751, 829, 863, 919, 953, 1009, 1021, 1033, 1069, 1097, 1123, 1151, 1171, 1237, 1277, 1291, 1409, 1423, 1489, 1607, 1621, 1973, 1987, 2027, 2087]