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.

A094841 Let p = n-th odd prime. Then a(n) = least positive integer 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 77683
13 77683
14 1333963
15 2404147
16 2404147
17 20950603
18 36254563
19 51599563
20 96295483
21 96295483
22 114148483
23 269497867
24 269497867
25 269497867
26 269497867
27 585811843
28 52947440683

List of values

[19, 43, 43, 67, 67, 163, 163, 163, 163, 163, 163, 77683, 77683, 1333963, 2404147, 2404147, 20950603, 36254563, 51599563, 96295483, 96295483, 114148483, 269497867, 269497867, 269497867, 269497867, 585811843, 52947440683]