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.

A338929 a(n) is the smallest prime number p larger than A072668(n) such that p is equal to 1 (mod A072668(n)).

Table of values

n a(n)
1 7
2 11
3 29
4 17
5 19
6 23
7 53
8 29
9 31
10 103
11 191
12 41
13 43
14 47
15 73
16 101
17 53
18 109
19 59
20 311
21 97
22 67
23 103
24 71
25 149
26 191
27 79
28 83
29 173
30 89
31 181
32 283
33 97
34 197
35 101
36 103
37 107
38 109
39 331
40 113
41 229
42 709
43 367
44 311
45 127
46 193
47 131
48 269
49 137
50 139
51 569
52 293
53 149
54 151
55 229
56 463

List of values

[7, 11, 29, 17, 19, 23, 53, 29, 31, 103, 191, 41, 43, 47, 73, 101, 53, 109, 59, 311, 97, 67, 103, 71, 149, 191, 79, 83, 173, 89, 181, 283, 97, 197, 101, 103, 107, 109, 331, 113, 229, 709, 367, 311, 127, 193, 131, 269, 137, 139, 569, 293, 149, 151, 229, 463]