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.

A001992 Let p = n-th odd prime. Then a(n) = least prime congruent to 5 modulo 8 such that Legendre(a(n), q) = -1 for all odd primes q <= p.

Table of values

n a(n)
1 5
2 53
3 173
4 173
5 293
6 2477
7 9173
8 9173
9 61613
10 74093
11 74093
12 74093
13 170957
14 360293
15 679733
16 2004917
17 2004917
18 69009533
19 138473837
20 237536213
21 384479933
22 883597853
23 1728061733
24 1728061733
25 1728061733
26 1728061733

List of values

[5, 53, 173, 173, 293, 2477, 9173, 9173, 61613, 74093, 74093, 74093, 170957, 360293, 679733, 2004917, 2004917, 69009533, 138473837, 237536213, 384479933, 883597853, 1728061733, 1728061733, 1728061733, 1728061733]