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

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

3,1

MATHEMATICA

f[n_] := Block[{k = 2}, While[ JacobiSymbol[n, Prime[k]] == 1, k++ ]; Prime[k]]; f /@ Prime[Range[3, 100]] (from Robert G. Wilson v Jun 24 2004)

CROSSREFS

Cf. A094928, A096633, A096634, A096635.

Sequence in context: A107489 A152050 A103506 * A096634 A105439 A142972

Adjacent sequences:  A094926 A094927 A094928 * A094930 A094931 A094932

KEYWORD

nonn

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com), Jun 19 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 17 17:51 EST 2012. Contains 206061 sequences.