A106856 Primes of the form x^2 + xy + 2y^2, with x and y nonnegative.
2, 11, 23, 37, 43, 53, 71, 79, 107, 109, 127, 137, 149, 151, 163, 193, 197, 211, 233, 239, 263, 281, 317, 331, 337, 373, 389, 401, 421, 431, 443, 463, 487, 491, 499, 541, 547, 557, 569, 599, 613, 617, 641, 653, 659, 673, 683, 739, 743, 751, 757, 809, 821
Offset: 1
A141177 Primes of the form -2*x^2 + 3*x*y + 3*y^2 (as well as of the form 4*x^2 + 7*x*y + y^2).
3, 31, 37, 67, 97, 103, 157, 163, 181, 199, 223, 229, 313, 331, 367, 379, 397, 421, 433, 463, 487, 499, 577, 619, 631, 643, 661, 691, 709, 727, 751, 757, 823, 829, 859, 883, 907, 991, 1021, 1039, 1087, 1093, 1123, 1153, 1171, 1213, 1237, 1279, 1291, 1303, 1321, 1423, 1453, 1483
Offset: 1
Keywords
Comments
Discriminant = 33. Class = 2. Binary quadratic forms a*x^2 + b*x*y + c*y^2 have discriminant d = b^2 - 4ac and gcd(a,b,c) = 1.
It is true that A141177(n+1) = A107013(n)? That is: except for p = 3 are these the primes represented by x^2 - x*y + 25*y^2 with x, y nonnegative? - Juan Arias-de-Reyna, Mar 19 2011
From Jianing Song, Jul 30 2018: (Start)
Also primes that are squares modulo 33.
Also primes of the form x^2 - x*y - 8*y^2 with 0 <= x <= y (or x^2 + x*y - 8*y^2 with x, y nonnegative).
These are primes = 3 or congruent to {1, 4, 16, 25, 31} mod 33. Note that the binary quadratic forms with discriminant 33 are in two classes as well as two genera, so there is one class in each genus. A141176 is in the other genus, with primes = 11 or congruent to {2, 8, 17, 29, 32} mod 33.
The observation from Juan Arias-de-Reyna is correct, since the binary quadratic forms with discriminant -99 are also in two classes as well as two genera. Note that -99 = 33*(-3) = (-11)*(-3)^2, so this sequence is essentially the same as A107013.
(End)
Examples
a(2) = 31 because we can write 31 = -2*4^2 + 3*4*3 + 3*3^2 (or 31 = 4*2^2 + 7*2*1 + 1^2).
References
- Z. I. Borevich and I. R. Shafarevich, Number Theory.
- D. B. Zagier, Zetafunktionen und quadratische Körper: Eine Einführung in die höhere Zahlentheorie, Springer-Verlag Berlin Heidelberg, 1981, DOI 10.1007/978-3-642-61829-1.
Links
- Juan Arias-de-Reyna, Table of n, a(n) for n = 1..10000
- N. J. A. Sloane et al., Binary Quadratic Forms and OEIS (Index to related sequences, programs, references)
Crossrefs
Cf. A141176 (d=33); A038872 (d=5); A038873 (d=8); A068228, A141123 (d=12); A038883 (d=13); A038889 (d=17); A141111, A141112 (d=65).
Cf. A243185 (numbers of the form -2*x^2 + 3*x*y + 3*y^2).
Cf. A107013.
For a list of sequences giving numbers and/or primes represented by binary quadratic forms, see the "Binary Quadratic Forms and OEIS" link.
Programs
-
Mathematica
Select[Prime[Range[500]], # == 3 || MatchQ[Mod[#, 33], Alternatives[1, 4, 16, 25, 31]]&] (* Jean-François Alcover, Oct 28 2016 *)
Comments
References
Links
Crossrefs
Programs
Mathematica
QuadPrimes2[a_, b_, c_, lmt_] := Module[{p, d, lst = {}, xMax, yMax}, d = b^2 - 4a*c; If[a > 0 && c > 0 && d < 0, xMax = Sqrt[lmt/a]*(1+Abs[b]/Floor[Sqrt[-d]])]; Do[ If[ 4c*lmt + d*x^2 >= 0, yMax = ((-b)*x + Sqrt[4c*lmt + d*x^2])/(2c), yMax = 0 ]; Do[p = a*x^2 + b*x*y + c*y^2; If[ PrimeQ[ p] && p <= lmt && !MemberQ[ lst, p], AppendTo[ lst, p]], {y, 0, yMax}], {x, 0, xMax}]; Sort[ lst]]; QuadPrimes2[1, 1, 2, 1000] (This is a corrected version of the old, incorrect, program QuadPrimes. - N. J. A. Sloane, Jun 15 2014) max = 1000; Table[yy = {y, 1, Floor[Sqrt[8 max - 7 x^2]/4 - x/4]}; Table[ x^2 + x y + 2 y^2, yy // Evaluate], {x, 0, Floor[Sqrt[max]]}] // Flatten // Union // Select[#, PrimeQ]& (* Jean-François Alcover, Oct 04 2018 *)PARI
Extensions