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.

A001988 Let p be the n-th odd prime. a(n) is the least prime congruent to 7 modulo 8 such that Legendre(-a(n), q) = -Legendre(-1, q) for all odd primes q <= p.

Table of values

n a(n)
1 7
2 7
3 127
4 463
5 463
6 487
7 1423
8 33247
9 73327
10 118903
11 118903
12 118903
13 454183
14 773767
15 773767
16 773767
17 773767
18 86976583
19 125325127
20 132690343
21 788667223
22 788667223
23 1280222287
24 2430076903
25 10703135983
26 10703135983
27 10703135983

List of values

[7, 7, 127, 463, 463, 487, 1423, 33247, 73327, 118903, 118903, 118903, 454183, 773767, 773767, 773767, 773767, 86976583, 125325127, 132690343, 788667223, 788667223, 1280222287, 2430076903, 10703135983, 10703135983, 10703135983]