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.

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

Table of values

n a(n)
1 1
2 3
3 4
4 184
5 9
6 1479
7 20799
8 31509
9 162094
10 83554
11 828844
12 895449
13 4631104
14 86925309
15 97476129
16 14684224
17 33547264
18 5381151099
19 516743824
20 1958770564
21 112746608529
22 3046156864
23 373079083204
24 1394424964
25 297469886464
26 1596601563489
27 976001733184
28 33344131402059

List of values

[1, 3, 4, 184, 9, 1479, 20799, 31509, 162094, 83554, 828844, 895449, 4631104, 86925309, 97476129, 14684224, 33547264, 5381151099, 516743824, 1958770564, 112746608529, 3046156864, 373079083204, 1394424964, 297469886464, 1596601563489, 976001733184, 33344131402059]