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.

A025046 a(n) = the least odd prime p such that there are exactly n consecutive quadratic remainders modulo p.

Table of values

n a(n)
2 3
3 5
4 19
5 17
6 67
7 71
8 131
9 73
10 277
11 311
12 827
13 241
14 1607
15 2543
16 3691
17 1559
18 6803
19 5711
20 14969
21 1009
22 43103
23 10559
24 52057
25 2689
26 90313
27 162263
28 127403
29 18191
30 209327
31 31391
32 607153
33 8089
34 1305511
35 298483
36 1694353
37 33049
38 3205777
39 1523707

List of values

[3, 5, 19, 17, 67, 71, 131, 73, 277, 311, 827, 241, 1607, 2543, 3691, 1559, 6803, 5711, 14969, 1009, 43103, 10559, 52057, 2689, 90313, 162263, 127403, 18191, 209327, 31391, 607153, 8089, 1305511, 298483, 1694353, 33049, 3205777, 1523707]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.