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.

A061303 Given a prime p, let s(p,0)=p and let s(p,n+1) be the smallest prime == 1 (mod s(p,n)). Let S(p) be the sequence {s(p,n): n=0,1,...}. Let a(0)=2 and let a(n+1) be the smallest prime not in any of the sequences S(a(0)), ..., S(a(n)).

Table of values

n a(n)
0 2
1 5
2 13
3 17
4 19
5 31
6 37
7 41
8 43
9 61
10 67
11 71
12 73
13 79
14 89
15 97
16 101
17 109
18 113
19 127
20 131
21 137
22 139
23 151
24 157
25 163
26 181
27 193
28 197
29 199
30 211
31 223
32 229
33 233
34 239
35 241
36 251
37 257
38 271
39 277
40 281
41 307
42 313
43 331
44 337
45 349
46 353
47 373
48 379
49 397
50 401
51 409
52 419
53 421
54 431
55 433

List of values

[2, 5, 13, 17, 19, 31, 37, 41, 43, 61, 67, 71, 73, 79, 89, 97, 101, 109, 113, 127, 131, 137, 139, 151, 157, 163, 181, 193, 197, 199, 211, 223, 229, 233, 239, 241, 251, 257, 271, 277, 281, 307, 313, 331, 337, 349, 353, 373, 379, 397, 401, 409, 419, 421, 431, 433]