login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A096634 Let p = n-th prime == 5 mod 8 (A007521); a(n) = smallest prime q such that p is not a square mod q. 2
3, 5, 3, 5, 3, 7, 3, 11, 3, 5, 3, 7, 3, 7, 3, 5, 3, 3, 7, 5, 3, 5, 13, 3, 3, 11, 3, 5, 3, 7, 3, 3, 13, 5, 5, 3, 3, 3, 7, 5, 5, 3, 5, 3, 7, 3, 7, 5, 3, 5, 3, 5, 3, 5, 3, 3, 3, 11, 11, 5, 3, 13, 5, 3, 17, 3, 7, 5, 3, 3, 7, 11, 7, 3, 3, 5, 3, 3, 3, 7, 5, 3, 3, 3, 11, 3, 13, 5, 3, 3, 7, 3, 3, 11, 5, 3, 3, 5, 3 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

MATHEMATICA

f[n_] := Block[{k = 2}, While[ JacobiSymbol[n, Prime[k]] == 1, k++ ]; Prime[k]]; f /@ Select[ Prime[ Range[435]], Mod[ #, 8] == 5 &]

CROSSREFS

Cf. A096638.

Sequence in context: A152050 A103506 A094929 * A105439 A142972 A020765

Adjacent sequences:  A096631 A096632 A096633 * A096635 A096636 A096637

KEYWORD

nonn

AUTHOR

Robert G. Wilson v (rgwv(AT)rgwv.com), Jun 24 2004

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 14 20:38 EST 2012. Contains 205663 sequences.