|
Search: id:A094928
|
|
|
| A094928 |
|
Let p = n-th prime == 1 mod 8 (A007519); a(n) = smallest prime q such that p is not a square mod q. |
|
+0
3
|
|
| 3, 3, 5, 3, 5, 3, 3, 5, 3, 7, 3, 3, 5, 5, 3, 3, 7, 5, 3, 5, 3, 3, 5, 3, 7, 3, 3, 5, 3, 7, 3, 3, 3, 3, 5, 3, 3, 11, 5, 3, 3, 11, 5, 3, 11, 3, 7, 3, 5, 7, 3, 3, 3, 3, 7, 3, 3, 7, 5, 3, 3, 5, 5, 11, 5, 3, 3, 5, 5, 3, 7, 5, 3, 5, 3, 7, 3, 7, 3, 5, 3, 3, 3, 5, 11, 5, 3, 5, 3, 3, 13, 5, 3, 3, 3, 3, 5, 5, 3, 5, 3, 7
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
REFERENCES
|
M. Kneser, Quadratische Formen, Springer, 2002; see Hilfssatz 18.3.
|
|
EXAMPLE
|
n=3, p = 73, a(3) = q = 5: Legendre(73,5) = -1.
|
|
MATHEMATICA
|
f[n_] := Prime[ Position[ JacobiSymbol[n, Select[Range[3, n - 1], PrimeQ[ # ] &]], -1][[1, 1]] + 1]; f /@ Select[ Prime[ Range[435]], Mod[ #, 8] == 1 &] (from Robert G. Wilson v Jun 23 2004)
|
|
CROSSREFS
|
Cf. A094929, A002224.
Adjacent sequences: A094925 A094926 A094927 this_sequence A094929 A094930 A094931
Sequence in context: A060397 A014780 A073081 this_sequence A065507 A101772 A131919
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
njas, Jun 19 2004
|
|
EXTENSIONS
|
More terms from Robert G. Wilson v (rgwv(AT)rgwv.com), Jun 23 2004
|
|
|
Search completed in 0.002 seconds
|
