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.

A385051 a(n) is the least positive number k such that n is the greatest m such that k is a quadratic nonresidue mod prime(i+1) for i=1..m and {k mod prime(i+1): i=1..m} are all distinct.

Table of values

n a(n)
0 1
1 2
2 8
3 68
4 173
5 593
6 1748
7 908
8 40178
9 74093
10 91538
11 93308
12 441803
13 10712063
14 7898483
15 35865968
16 133019963
17 206951093
18 1314259253
19 2453647853
20 6701493818
21 54776939873
22 7717930358
23 250589717363
24 255937042268
25 3665861003153
26 957987212453
27 9953155219223

List of values

[1, 2, 8, 68, 173, 593, 1748, 908, 40178, 74093, 91538, 93308, 441803, 10712063, 7898483, 35865968, 133019963, 206951093, 1314259253, 2453647853, 6701493818, 54776939873, 7717930358, 250589717363, 255937042268, 3665861003153, 957987212453, 9953155219223]