login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A096637 Smallest prime p == 1 mod 8 (A007519) and p > prime(n+2) such that p is a quadratic residue mod the first n odd primes 3, 5, 7, 11, ..., prime(n+1), and p is a quadratic non-residue mod prime(n+2). 2
17, 73, 241, 1009, 2689, 8089, 33049, 53881, 87481, 483289, 515761, 1083289, 7921489, 3818929, 9257329, 22000801, 68204761, 48473881, 175244281, 1149374521, 427733329, 898716289 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,1

COMMENTS

Same as smallest prime p == 1 mod 8 with the property that the Legendre symbol (p|q) = 1 for the first n odd primes q = prime(k+1), k = 1, 2, ..., n, and (p|q) = -1 for q = prime(n+2).

LINKS

Table of n, a(n) for n=0..21.

MATHEMATICA

f[n_] := Block[{k = 2}, While[ JacobiSymbol[n, Prime[k]] == 1, k++ ]; Prime[k]]; t = Table[0, {50}]; Do[p = Prime[n]; If[Mod[p, 8] == 1, a = f[p]; If[ t[[ PrimePi[a]]] == 0, t[[ PrimePi[a]]] = p; Print[ PrimePi[a], " = ", p]]], {n, 10^9}]; t

CROSSREFS

Cf. A094928, A002224, A096636.

Sequence in context: A142648 A002189 A002224 * A201610 A201262 A146658

Adjacent sequences:  A096634 A096635 A096636 * A096638 A096639 A096640

KEYWORD

nonn

AUTHOR

Robert G. Wilson v, Jun 24 2004

EXTENSIONS

Better name from Jonathan Sondow, Mar 07 2013

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 30 15:50 EDT 2022. Contains 357106 sequences. (Running on oeis4.)