|
Search: id:A007522
|
|
|
| A007522 |
|
Primes of form 8n+7.
(Formerly M4376)
|
|
+0
35
|
|
| 7, 23, 31, 47, 71, 79, 103, 127, 151, 167, 191, 199, 223, 239, 263, 271, 311, 359, 367, 383, 431, 439, 463, 479, 487, 503, 599, 607, 631, 647, 719, 727, 743, 751, 823, 839, 863, 887, 911, 919, 967, 983, 991, 1031, 1039, 1063, 1087, 1103, 1151
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
Primes p such that x^4 = 2 has just two solutions mod p. Subsequence of A040098. Solutions mod p are represented by integers from 0 to p - 1. For p > 2, i is a solution mod p of x^4 = 2 iff p - i is a solution mod p of x^4 = 2, so the sum of the two solutions is p. The solutions are given in A065907 and A065908. - Klaus Brockhaus (klaus-brockhaus(AT)t-online.de), Nov 28 2001
Is this the same sequence as A141175?
|
|
REFERENCES
|
M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards Applied Math. Series 55, 1964 (and various reprintings), p. 870.
|
|
LINKS
|
T. D. Noe, Table of n, a(n) for n=1..1000
M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards, Applied Math. Series 55, Tenth Printing, December 1972 [alternative scanned copy].
|
|
FORMULA
|
Equals A000040 INTERSECT A004215. R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Nov 22 2006
|
|
MATHEMATICA
|
a={}; Do[x=8*n-1; If[PrimeQ[x], AppendTo[a, x]], {n, 10^2}]; a - Vladimir Orlovsky (4vladimir(AT)gmail.com), Apr 29 2008
|
|
PROGRAM
|
(PARI): A007522(m) = local(p, s, x, z); forprime(p = 3, m, s = []; for(x = 0, p-1, if(x^4%p == 2%p, s = concat(s, [x]))); z = matsize(s)[2]; if(z == 2, print1(p, ", "))) A007522(1400)
|
|
CROSSREFS
|
Cf. A040098, A007522, A014754, A065907, A065908.
Adjacent sequences: A007519 A007520 A007521 this_sequence A007523 A007524 A007525
Sequence in context: A089199 A014663 A141175 this_sequence A098029 A098039 A132237
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
njas, Robert G. Wilson v (rgwv(AT)rgwv.com)
|
|
|
Search completed in 0.002 seconds
|
