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.

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

Table of values

n a(n)
1 19
2 43
3 43
4 67
5 67
6 163
7 163
8 163
9 163
10 163
11 163
12 222643
13 1333963
14 1333963
15 2404147
16 2404147
17 20950603
18 51599563
19 51599563
20 96295483
21 96295483
22 146161723
23 1408126003
24 3341091163
25 3341091163
26 3341091163
27 52947440683
28 52947440683
29 52947440683
30 193310265163

List of values

[19, 43, 43, 67, 67, 163, 163, 163, 163, 163, 163, 222643, 1333963, 1333963, 2404147, 2404147, 20950603, 51599563, 51599563, 96295483, 96295483, 146161723, 1408126003, 3341091163, 3341091163, 3341091163, 52947440683, 52947440683, 52947440683, 193310265163]