Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A096634
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A096634 Let p = n-th prime == 5 mod 8 (A007521); a(n) = smallest prime q such that p is not a square mod q. +0
3
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; listen)
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 this_sequence A105439 A142972 A020765

Adjacent sequences: A096631 A096632 A096633 this_sequence A096635 A096636 A096637

KEYWORD

nonn

AUTHOR

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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 30 13:13 EST 2009. Contains 167758 sequences.


AT&T Labs Research