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.

A249797 a(1) = 2; thereafter, a(n) is the smallest prime not yet used which is compatible with the condition that a(n) is a non-quadratic residue modulo a(k) for the next n indices k = n + 1, n + 2, ..., 2n.

Table of values

n a(n)
1 2
2 3
3 5
4 7
5 13
6 67
7 41
8 71
9 19
10 97
11 199
12 263
13 311
14 7121
15 3221
16 8581
17 373
18 977
19 331
20 1723
21 2161
22 27409
23 19079
24 42967
25 61441
26 206051
27 16649
28 212777
29 236527
30 572651
31 175897
32 258521
33 1010291
34 1369559
35 2530067

List of values

[2, 3, 5, 7, 13, 67, 41, 71, 19, 97, 199, 263, 311, 7121, 3221, 8581, 373, 977, 331, 1723, 2161, 27409, 19079, 42967, 61441, 206051, 16649, 212777, 236527, 572651, 175897, 258521, 1010291, 1369559, 2530067]