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.

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

Table of values

n a(n)
1 5
2 29
3 29
4 29
5 29
6 29
7 29
8 29
9 23669
10 23669
11 23669
12 23669
13 23669
14 23669
15 1508789
16 5025869
17 9636461
18 9636461
19 9636461
20 37989701
21 37989701
22 37989701
23 37989701
24 37989701
25 240511301
26 240511301

List of values

[5, 29, 29, 29, 29, 29, 29, 29, 23669, 23669, 23669, 23669, 23669, 23669, 1508789, 5025869, 9636461, 9636461, 9636461, 37989701, 37989701, 37989701, 37989701, 37989701, 240511301, 240511301]