|
Search: id:A038872
|
|
|
| A038872 |
|
Primes congruent to {0, 1, 4} mod 5. |
|
+0
69
|
|
| 5, 11, 19, 29, 31, 41, 59, 61, 71, 79, 89, 101, 109, 131, 139, 149, 151, 179, 181, 191, 199, 211, 229, 239, 241, 251, 269, 271, 281, 311, 331, 349, 359, 379, 389, 401, 409, 419, 421, 431, 439, 449, 461, 479, 491, 499, 509, 521, 541, 569, 571, 599, 601, 619
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
Also odd primes p such that 5 is a square mod p: (5/p) = +1.
Primes of the form x^2+x*y-y^2 (as well as of the form x^2+3*x*y+y^2). Discriminant = 5. Class = 1. Binary quadratic forms a*x^2+b*x*y+c*y^2 have discriminant d=b^2-4ac and gcd(a,b,c)=1. This was originally a separate entry, submitted by Laura Caballero Fernandez, Lourdes Calvo Moguer, Maria Josefa Cano Marquez, Oscar Jesus Falcon Ganfornina and Sergio Garrido Morales (oscfalgan(AT)yahoo.es), Jun 06 2008. R. J. Mathar proved that this coincides with the present sequence, Jul 22 2008
Is this the same sequence as A141158?
|
|
REFERENCES
|
Borevich and Shafaewich, Number Theory.
D. B. Zagier, Zetafunktionen und quadratische Koerper.
|
|
LINKS
|
C. Banderier, Calcul de (5/p)
|
|
MATHEMATICA
|
lst={}; Do[p=Prime[n]; If[Mod[p, 5]==0||Mod[p, 5]==1||Mod[p, 5]==4, AppendTo[lst, p]], {n, 6!}]; lst [From Vladimir Orlovsky (4vladimir(AT)gmail.com), Feb 26 2009]
|
|
CROSSREFS
|
Cf. A038872 (Primes congruent to {0, 1, 4}) A141111, A141112 (d=65).
Sequence in context: A048217 A132087 A089270 this_sequence A141158 A130828 A108151
Adjacent sequences: A038869 A038870 A038871 this_sequence A038873 A038874 A038875
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
EXTENSIONS
|
Corrected and extended by Peter K. Pearson (ppearson+att(AT)spamcop.net), May 29 2005
Edited by N. J. A. Sloane (njas(AT)research.att.com), Jul 28 2008 at the suggestion of R. J. Mathar.
|
|
|
Search completed in 0.005 seconds
|
