|
Search: id:A007519
|
|
|
| A007519 |
|
Primes of form 8n+1, that is, primes congruent to 1 mod 8.
(Formerly M5037)
|
|
+0
48
|
|
| 17, 41, 73, 89, 97, 113, 137, 193, 233, 241, 257, 281, 313, 337, 353, 401, 409, 433, 449, 457, 521, 569, 577, 593, 601, 617, 641, 673, 761, 769, 809, 857, 881, 929, 937, 953, 977, 1009, 1033, 1049, 1097, 1129, 1153, 1193, 1201, 1217, 1249, 1289, 1297, 1321, 1361
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
Integers n (n>9) of form 4k+1 such that binomial(n-1,(n-1)/4) == 1 (mod n) - Benoit Cloitre (benoit7848c(AT)orange.fr), Feb 07 2004
Primes of the form x^2+8y^2. - T. D. Noe (noe(AT)sspectra.com), May 07 2005
Also primes of the form x^2+16y^2. See A140633. - T. D. Noe (noe(AT)sspectra.com), May 19 2008
Is this the same sequence as A141174?
Contribution from Tito Piezas III (tpiezas(AT)gmail.com), Dec 28 2008: (Start)
See also remarks in A141174. Being a subset of A001132, this is also a subset of the primes of form u^2-2v^2. (End)
|
|
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.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
|
|
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, 1972 [alternative scanned copy].
|
|
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
|
|
CROSSREFS
|
Cf. A139643. Complement in primes of A154264. Cf. A042987.
Sequence in context: A089200 A004625 A141174 this_sequence A163185 A138005 A166147
Adjacent sequences: A007516 A007517 A007518 this_sequence A007520 A007521 A007522
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com), Robert G. Wilson v (rgwv(AT)rgwv.com)
|
|
|
Search completed in 0.002 seconds
|
