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.

A094847 Let p = n-th odd prime. Then a(n) = least positive integer 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 437
7 9173
8 9173
9 24653
10 74093
11 74093
12 74093
13 170957
14 214037
15 214037
16 214037
17 2004917
18 44401013
19 71148173
20 154554077
21 154554077
22 163520117
23 163520117
24 163520117
25 261153653
26 261153653
27 1728061733

List of values

[5, 53, 173, 173, 293, 437, 9173, 9173, 24653, 74093, 74093, 74093, 170957, 214037, 214037, 214037, 2004917, 44401013, 71148173, 154554077, 154554077, 163520117, 163520117, 163520117, 261153653, 261153653, 1728061733]