A106856 -id:A106856 - cp's OEIS frontend

A139827 Primes of the form 2x^2 + 2xy + 17y^2.

2, 17, 29, 41, 101, 149, 173, 197, 233, 281, 293, 461, 557, 569, 593, 677, 701, 761, 809, 821, 857, 941, 953, 1097, 1217, 1229, 1289, 1361, 1481, 1493, 1553, 1601, 1613, 1733, 1877, 1889, 1913, 1949, 1997, 2081, 2129, 2141, 2153, 2213, 2273, 2309, 2393, 2417

Offset: 1

T. D. Noe, May 02 2008, May 07 2008

Discriminant = -132.
Consider the quadratic form f(x,y) = ax^2 + bxy + cy^2. When the discriminant d=b^2-4ac is -4 times an idoneal number (A000926), there is exactly one class for each genus. As a result, the primes generated by f(x,y) are the same as the primes congruent to S (mod -d), where S is a set of numbers less than -d. The table on page 60 of Cox shows that there are exactly 331 quadratic forms having this property. The 217 sequences starting with this one complete the collection in the OEIS.
When a=1 and b=0, f(x,y) is a quadratic form whose congruences are discussed in A139642. Let N be an idoneal number. Then there are 2^r reduced quadratic forms whose discriminant is -4N, where r=1,2,3, or 4. By collecting the residuals p (mod 4N) for primes p generated by the i-th reduced quadratic form, we can empirically find a set Si. To show that the 2^r sets Si are complete, we only need to show that the union of the Si is equal to the set of numbers k such that the Jacobi symbol (-k/4N)=1.

David A. Cox, Primes of the Form x^2 + n y^2, Wiley, 1989.

Ray Chandler, Table of n, a(n) for n = 1..10000 (first 1000 terms from T. D. Noe)
N. J. A. Sloane et al., Binary Quadratic Forms and OEIS (Index to related sequences, programs, references)

Cf. A139643, A139841-A139843 (d=-408), A139644, A139844-A139850 (d=-420), A139645, A139851-A139853 (d=-448), A139502, A139854-A139860 (d=-480), A139646, A139861-A139863 (d=-520), A139647, A139864-A139866 (d=-532), A139648, A139867-A139873 (d=-660), A139506, A139874-A139880 (d=-672), A139649, A139881-A139883 (d=-708), A139650, A139884-A139886 (d=-760), A139651, A139887-A139893 (d=-840), A139652, A139894-A139896 (d=-928), A139502, A139855, A139857, A139858, A139897-A139899, A139902 (d=-960).
Cf. also  A139653, A139904-A139906 (d=-1012), A139654, A139907-A139913 (d=-1092), A139655, A139914-A139920 (d=-1120), A139656, A139921-A139927 (d=-1248), A139657, A139928-A139934 (d=-1320), A139658, A139935-A139941 (d=-1380), A139659, A139942-A139948 (d=-1428), A139660, A139949-A139955 (d=-1540), A139661, A139956-A139962 (d=-1632), A139662, A139963-A139969 (d=-1848), A139663, A139970-A139976 (d=-2080), A139664, A139977-A139983 (d=-3040), A139665, A139984-A139998 (d=-3360), A139666, A139999-A140013 (d=-5280), A139667, A140014-A140028 (d=-5460), A139668, A140029-A140043 (d=-7392).
For a more complete list of sequences giving numbers and/or primes represented by binary quadratic forms, see the "Binary Quadratic Forms and OEIS" link.

[ p: p in PrimesUpTo(2500) | p mod 132 in {2, 17, 29, 41, 65, 101}]; // Vincenzo Librandi, Jul 29 2012

QuadPrimes2[2, -2, 17, 2500] (* see A106856 *)
t = Table[{2, 17, 29, 41, 65, 101} + 132*n, {n, 0, 50}]; Select[Flatten[t], PrimeQ] (* T. D. Noe, Jun 21 2012 *)

v=[2, 17, 29, 41, 65, 101]; select(p->setsearch(v,p%132),primes(100)) \\ Charles R Greathouse IV, Jan 08 2013

The primes are congruent to {2, 17, 29, 41, 65, 101} (mod 132).

A107132 Primes of the form 2x^2 + 13y^2.

Original entry on oeis.org

2, 13, 31, 149, 167, 317, 359, 397, 463, 487, 509, 613, 661, 709, 839, 1061, 1087, 1103, 1151, 1181, 1367, 1471, 1783, 1789, 1861, 2039, 2111, 2221, 2269, 2437, 2503, 2621, 2647, 2917, 2927, 2957, 3023, 3079, 3167, 3229, 3373, 3541, 3853

Offset: 1

T. D. Noe, May 13 2005

Discriminant = -104. Binary quadratic forms ax^2+cy^2 have discriminant d=-4ac. We consider sequences of primes produced by forms with -400<=d<=0, a<=c and gcd(a,c)=1. These restrictions yield 173 sequences of prime numbers, which are organized by discriminant below. See A106856 for primes of the form ax^2+bxy+cy^2 with discriminant > -100.

David A. Cox, Primes of the Form x^2 + n y^2, Wiley, 1989.
L. E. Dickson, History of the Theory of Numbers, Vol. 3, Chelsea, 1923.

Vincenzo Librandi and Ray Chandler, Table of n, a(n) for n = 1..10000 [First 1000 terms from Vincenzo Librandi]
N. J. A. Sloane et al., Binary Quadratic Forms and OEIS (Index to related sequences, programs, references)

Cf. A033218 (d=-104), A014752 (d=-108), A107133, A107134 (d=-112), A033219 (d=-116), A107135-A107137, A033220 (d=-120), A033221 (d=-124), A105389 (d=-128), A107138, A033222 (d=-132), A107139, A033223 (d=-136), A107140, A033224 (d=-140), A107141, A107142 (d=-144), A033225 (d=-148), A107143, A033226 (d=-152), A033227 (d=-156), A107144, A107145 (d=-160), A033228 (d=-164), A107146-A107148, A033229 (d=-168).
Cf. A033230 (d=-172), A107149, A107150 (d=-176), A107151, A107152 (d=-180), A107153, A033231 (d=-184), A033232 (d=-188), A141373 (d=-192), A107155 (d=-196), A107156, A107157 (d=-200), A107158, A033233 (d=-204), A107159, A107160 (d=-208), A033234 (d=-212), A107161, A107162 (d=-216), A033235 (d=-220), A107163, A107164 (d=-224), A107165, A033236 (d=-228), A107166, A033237 (d=-232), A033238 (d=-236).
Cf. A107167-A107169 (d=-240), A033239 (d=-244), A107170, A033240 (d=-248), A014754 (d=-256), A107171, A033241 (d=-260), A107172-A107174, A033242 (d=-264), A033243 (d=-268), A107175, A107176 (d=-272), A107177, A033244 (d=-276), A107178-A107180, A033245 (d=-280), A033246 (d=-284), A107181 (d=-288), A033247 (d=-292), A107182, A033248 (d=-296), A107183, A107184 (d=-300), A107185, A107186 (d=-304), A107187, A033249 (d=-308).
Cf. A107188-A107190, A033250 (d=-312), A033251 (d=-316), A107191, A107192 (d=-320), A107193 (d=-324), A107194, A033252 (d=-328), A033253 (d=-332), A107195-A107198 (d=-336), A107199, A033254 (d=-340), A107200, A033255 (d=-344), A033256 (d=-348), A107132 A107201, A107202 (d=-352), A033257 (d=-356), A107203-A107206 (d=-360), A107207, A033258 (d=-364), A107208, A107209 (d=-368), A107210, A033202 (d=-372).
Cf. A107211, A033204 (d=-376), A033206 (d=-380), A107212, A107213 (d=-384), A033208 (d=-388), A107214, A107215 (d=-392), A107216, A107217 (d=-396), A107218, A107219 (d=-400).
For a more complete list of sequences giving numbers and/or primes represented by binary quadratic forms, see the "Binary Quadratic Forms and OEIS" link.

QuadPrimes2[2, 0, 13, 10000] (* see A106856 *)

list(lim)=my(v=List([2,13]),t); for(y=1,sqrtint(lim\13), for(x=1,sqrtint((lim-13*y^2)\2), if(isprime(t=2*x^2+13*y^2), listput(v,t)))); Set(v) \\ Charles R Greathouse IV, Feb 07 2017

A140633 Primes of the form 7x^2+4xy+52y^2.

Original entry on oeis.org

7, 103, 127, 223, 367, 463, 487, 607, 727, 823, 967, 1063, 1087, 1303, 1327, 1423, 1447, 1543, 1567, 1663, 1783, 2143, 2287, 2383, 2503, 2647, 2767, 2887, 3343, 3463, 3583, 3607, 3727, 3823, 3847, 3943, 3967, 4327, 4423, 4447, 4567, 4663

Offset: 1

T. D. Noe, May 19 2008

Discriminant=-1440. Also primes of the forms 7x^2+6xy+87y^2 and 7x^2+2xy+103y^2.
Voight proves that there are exactly 69 equivalence classes of positive definite binary quadratic forms that represent almost the same primes. 48 of those quadratic forms are of the idoneal type discussed in A139827. The remaining 21 begin at A140613 and end here. The cross-references section lists the quadratic forms in the same order as tables 1-6 in Voight's paper. Note that A107169 and A139831 are in the same equivalence class.
In base 12, the sequence is 7, 87, X7, 167, 267, 327, 347, 427, 507, 587, 687, 747, 767, 907, 927, 9X7, X07, X87, XX7, E67, 1047, 12X7, 13X7, 1467, 1547, 1647, 1727, 1807, 1E27, 2007, 20X7, 2107, 21X7, 2267, 2287, 2347, 2367, 2607, 2687, 26X7, 2787, 2847, where X is for 10 and E is for 11. Moreover, the discriminant is X00 and that all elements are {7, 87, X7, 167, 187, 247} mod 260. - Walter Kehowski, May 31 2008

Vincenzo Librandi and Ray Chandler, Table of n, a(n) for n = 1..10000 [First 1000 terms from Vincenzo Librandi]
N. J. A. Sloane et al., Binary Quadratic Forms and OEIS (Index to related sequences, programs, references)
John Voight, Quadratic forms that represent almost the same primes, Math. Comp., Vol. 76 (2007), pp. 1589-1617.

Cf. A033205, A007519, A068228, A107135, A107144, A107152, A107151.
Cf. A107181, A139502, A139856, A139854, A139874, A139877, A139897.
Cf. A140613, A140614. A140615, A139923, A140616-A140619, A139988.
Cf. A139993, A140008, A140010, A140620-A140632, A033212, A102273.
Cf. A107007, A107003, A139830, A107169, A139831, A141373, A139847.
Cf. A139850, A139855, A139860, A139879, A139880, A139924, A139990.
Cf. A139998, A139992, A139996, A140003, A140013, A107006, A139858.
Cf. A107008, A140633, A139991, A139857, A139859, A139878, A007645, A002313.

Union[QuadPrimes2[7, 4, 52, 10000], QuadPrimes2[7, -4, 52, 10000]] (* see A106856 *)

A139643 Primes of the form x^2+Ny^2, with N=102.

Original entry on oeis.org

103, 127, 151, 223, 271, 409, 433, 457, 463, 577, 631, 727, 769, 919, 937, 967, 1033, 1039, 1063, 1087, 1249, 1279, 1327, 1447, 1471, 1543, 1657, 1753, 1759, 1777, 1783, 1801, 1879, 1951, 1993, 2089, 2143, 2161, 2287, 2311, 2473, 2503, 2551

Offset: 1

T. D. Noe, Apr 29 2008

Discriminant=-408. N is an idoneal number (A000926), which means that the quadratic form's genus consists of a single class, which means that the primes of this form are identical to the primes that are congruent to c (mod 4N), where c is a set of numbers less than 4N. The sequence A139642 lists the set c for each idoneal number. That sequence also cross references the sequences for the quadratic forms with N equal to the first 36 idoneal numbers. The remaining quadratic forms are this sequence and the 28 listed in order below. Note that the sequences for N=120 and 240 are the same.

The primes are congruent to {1, 25, 49, 55, 103, 121, 127, 145, 151, 169, 217, 223, 247, 271, 319, 361} (mod 408).

David A. Cox, Primes of the Form x^2 + n y^2, Wiley, 1989.
L. E. Dickson, History of the Theory of Numbers, Vol 3, Chelsea, 1923.

Vincenzo Librandi and Ray Chandler, Table of n, a(n) for n = 1..10000 [First 1000 terms from Vincenzo Librandi]
N. J. A. Sloane et al., Binary Quadratic Forms and OEIS (Index to related sequences, programs, references)

Cf. A139644, A139645, A139502, A139646, A139647, A139648, A139506, A139649, A139650, A139651, A139652, A139502, A139653-A139668.

[ p: p in PrimesUpTo(3000) | p mod 408 in {1, 25, 49, 55, 103, 121, 127, 145, 151, 169, 217, 223, 247, 271, 319, 361}]; // Vincenzo Librandi, Jul 28 2012

k:=102; [p: p in PrimesUpTo(3000) | NormEquation(k, p) eq true]; // Bruno Berselli, Jun 01 2016

C:= [1, 25, 49, 55, 103, 121, 127, 145, 151, 169, 217, 223, 247, 271, 319, 361]:
select(isprime, [seq(seq(408*i+j,j=C),i=0..100)]); # Robert Israel, Jul 03 2016

nn=102; pMax=10000; Union[Reap[Do[p=x^2+nn*y^2; If[p<=pMax && PrimeQ[p], Sow[p]], {x,Sqrt[pMax]}, {y, Sqrt[pMax/nn]}]][[2,1]]] (* T. D. Noe, Aug 02 2009 *)
QuadPrimes2[1, 0, 102, 10000] (* see A106856 *)

A033212 Primes congruent to 1 or 19 (mod 30).

Original entry on oeis.org

19, 31, 61, 79, 109, 139, 151, 181, 199, 211, 229, 241, 271, 331, 349, 379, 409, 421, 439, 499, 541, 571, 601, 619, 631, 661, 691, 709, 739, 751, 769, 811, 829, 859, 919, 991, 1009, 1021, 1039, 1051, 1069, 1129, 1171, 1201, 1231, 1249, 1279, 1291, 1321, 1381

Offset: 1

N. J. A. Sloane

Theorem: Same as primes of the form x^2+15*y^2 (discriminant -60). Proof: Cox, Cor. 2.27, p. 36.
Equivalently, primes congruent to 1 or 4 (mod 15). Also x^2+xy+4y^2 is the principal form of (fundamental) discriminant -15. The only other class for -15 contains the form 2x^2+xy+2y^2 (A106859), in the other genus. - Rick L. Shepherd, Jul 25 2014
Three further theorems (these were originally stated as conjectures, but are now known to be theorems, thanks to the work of J. B. Tunnell - see link):
1. The same as primes of the form x^2-xy+4y^2 (discriminant -15) and x^2-xy+19y^2 (discriminant -75), both with x and y nonnegative. - T. D. Noe, Apr 29 2008
2. The same as primes of the form x^2+xy+19y^2 (discriminant -75), with x and y nonnegative. - T. D. Noe, Apr 29 2008
3. The same as primes of the form x^2+5xy-5y^2 (discriminant 45). - N. J. A. Sloane, Jun 01 2014
Also primes of the form x^2+7*x*y+y^2 (discriminant 45).
Lemma (Will Jagy, Jun 12 2014): If c is any (positive or negative) even number, then x^2 + x y + c y^2 and x^2 + (4 c - 1) y^2 represent the same odd numbers.
Proof: x (x + y) + c y^2 = odd, therefore x is odd,  x + y odd, so y is even. Let y = 2 t. Then x( x + 2 t) + 4 c t^2 = x^2 + 2 x t  + 4 c t^2 = (x+t)^2 + (4c-1) t^2 = odd. QED With c = 4, neither one represents 2, so x^2+15y^2 and x^2+xy+4y^2 represent the same primes.
Also, primes which are squares (mod 3*5). Subsequence of A191018. - David Broadhurst and M. F. Hasler, Jan 15 2016

Z. I. Borevich and I. R. Shafarevich, Number Theory. Academic Press, NY, 1966.
David A. Cox, Primes of the Form x^2 + n y^2, Wiley, 1989.

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. OEIS wiki, June 2014.
J. B. Tunnell, Proofs of Conjectures Concerning Entry A033212, the Sequence of Primes Congruent to 1 or 19 (mod 30)
D. B. Zagier, Zetafunktionen und quadratische Körper, Springer, 1981.

Cf. A106856, A139643, A106859.
Primes in A243173 and in A243174.
Cf. A141785 (d=45), A033212 (Primes of form x^2+15*y^2), A038872(d=5), A038873 (d=8), A068228, A141123 (d=12), A038883 (d=13), A038889 (d=17), A141111, A141112 (d=65).
For a list of sequences giving numbers and/or primes represented by binary quadratic forms, see the "Binary Quadratic Forms and OEIS" link.

QuadPrimes2[1, 0, 15, 10000] (* see A106856 *)
Select[Prime@Range[250], MemberQ[{1, 19}, Mod[#, 30]] &] (* Vincenzo Librandi, Apr 05 2015 *)

select(n->n%30==1||n%30==19, primes(100)) \\ Charles R Greathouse IV, Nov 09 2012

is(p)=issquare(Mod(p,15))&&isprime(p) \\ M. F. Hasler, Jan 15 2016

a(n) ~ 4n log n. - Charles R Greathouse IV, Nov 09 2012

Edited by N. J. A. Sloane, Jun 01 2014 and Oct 18 2014: added Tunnell document, revised entry, merged with A141184. The latter entry was 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 12 2008.

Typo in crossrefs fixed by Colin Barker, Apr 05 2015

A107152 Primes of the form x^2 + 45y^2.

Original entry on oeis.org

61, 109, 181, 229, 241, 349, 409, 421, 541, 601, 661, 709, 769, 829, 1009, 1021, 1069, 1129, 1201, 1249, 1321, 1381, 1429, 1489, 1549, 1609, 1621, 1669, 1741, 1789, 1801, 1861, 2029, 2089, 2161, 2221, 2269, 2281, 2341, 2389, 2521, 2689, 2749, 3001, 3049, 3061, 3109, 3121, 3169, 3181

Offset: 1

T. D. Noe, May 13 2005

Discriminant = -180. See A107132 for more information.
Also primes of the form x^2 + 60y^2. See A140633. - T. D. Noe, May 19 2008
Also primes of the form x^2+6*x*y-6*y^2, of discriminant 60 (as well as of the form x^2+8*x*y+y^2). -  Laura Caballero Fernandez, Lourdes Calvo Moguer, Maria Josefa Cano Marquez, Oscar Jesus Falcon Ganfornina and Sergio Garrido Morales (oscfalgan(AT)yahoo.es), Jun 24 2008

Z. I. Borevich and I. R. Shafarevich, Number Theory.

Ray Chandler, Table of n, a(n) for n = 1..10000 [First 1000 terms from Vincenzo Librandi]
William C. Jagy and Irving Kaplansky, Positive definite binary quadratic forms that represent the same primes [Cached copy]
N. J. A. Sloane et al., Binary Quadratic Forms and OEIS: Index to related sequences, programs, references. OEIS wiki, June 2014.
D. B. Zagier, Zetafunktionen und quadratische Körper, Springer, 1981.

Cf. A139643.
Cf. A141302, A141303, A141304 (d=60).
All representatives in A243188.
For a list of sequences giving numbers and/or primes represented by binary quadratic forms, see the "Binary Quadratic Forms and OEIS" link.

[ p: p in PrimesUpTo(3000) | p mod 60 in {1, 49 } ]; // Vincenzo Librandi, Jul 24 2012

QuadPrimes2[1, 0, 45, 10000] (* see A106856 *)
Select[Prime[Range[500]], MatchQ[Mod[#, 60], 1|49]&] (* Jean-François Alcover, Oct 28 2016 *)

list(lim)=my(v=List(),t); forprime(p=61,lim, t=p%60; if(t==1||t==49, listput(v,p))); Vec(v) \\ Charles R Greathouse IV, Feb 09 2017

Primes congruent to {1, 49} (mod 60). - T. D. Noe, Apr 29 2008

A107008 Primes of the form x^2 + 24*y^2.

Original entry on oeis.org

73, 97, 193, 241, 313, 337, 409, 433, 457, 577, 601, 673, 769, 937, 1009, 1033, 1129, 1153, 1201, 1249, 1297, 1321, 1489, 1609, 1657, 1753, 1777, 1801, 1873, 1993, 2017, 2089, 2113, 2137, 2161, 2281, 2377, 2473, 2521, 2593, 2617, 2689, 2713

Offset: 1

T. D. Noe, May 09 2005

Presumably this is the same as primes congruent to 1 mod 24, so a(n) = 24*A111174(n) + 1. - N. J. A. Sloane, Jul 11 2008. Checked for all terms up to 2 million. - Vladimir Joseph Stephan Orlovsky, May 18 2011.
Discriminant = -96.
Also primes of the forms x^2 + 48*y^2 and x^2 + 72*y^2. See A140633. - T. D. Noe, May 19 2008
Primes of the quadratic form are a subset of the primes congruent to 1 (mod 24). [Proof. For 0 <= x, y <= 23, the only values mod 24 that x^2 + 24*y^2 can take are 0, 1, 4, 9, 12 or 16. All of these r except 1 have gcd(r, 24) > 1 so if x^2 + 24*y^2 is prime its remainder mod 24 must be 1.] - David A. Corneth, Jun 08 2020
More advanced mathematics seems to be needed to determine whether this sequence lists all primes congruent to 1 (mod 24). Note the significance of 24 being a convenient number, as described in A000926. See also Sloane et al., Binary Quadratic Forms and OEIS, which explains how the table in A139642 may be used for this determination. - Peter Munn, Jun 21 2020
Primes == 1 (mod 2^3*3) are the intersection of the primes == 1 (mod 2^3) in A007519 and the primes == 1 (mod 3) in A002476, by the Chinese remainder theorem. - R. J. Mathar, Jun 11 2020

Vincenzo Librandi, N. J. A. Sloane and Ray Chandler, Table of n, a(n) for n = 1..10000 [First 1000 terms from Vincenzo Librandi, next 143 terms from N. J. A. Sloane]
P. L. Clark, J. Hicks, H. Parshall, K. Thompson, GONI: primes represented by binary quadratic forms, INTEGERS 13 (2013) #A37
D. A. Cox, Primes of the form x^2 + n*y^2, A Wiley-Interscience publication, 1989
N. J. A. Sloane et al., Binary Quadratic Forms and OEIS (Index to related sequences, programs, references)
J. Voight, Quadratic forms that represent almost the same primes, Math. Comp. 76 (2007) 1589-1617

Subset of A033199 (2y here = y there).
Is this the same as A141375?
Cf. A000926, A002476, A007519, A111174, A139642.
See also the cross-references in A140633.

QuadPrimes[1, 0, 24, 10000] (* see A106856 *)

is(n) = isprime(n) && #qfbsolve(Qfb(1, 0, 24), n) == 2 \\ David A. Corneth, Jun 21 2020

Recomputed b-file, deleted incorrect Mma program. - N. J. A. Sloane, Jun 08 2014

A033203 Primes p congruent to {1, 2, 3} (mod 8); or primes p of form x^2 + 2*y^2; or primes p such that x^2 = -2 has a solution mod p.

Original entry on oeis.org

2, 3, 11, 17, 19, 41, 43, 59, 67, 73, 83, 89, 97, 107, 113, 131, 137, 139, 163, 179, 193, 211, 227, 233, 241, 251, 257, 281, 283, 307, 313, 331, 337, 347, 353, 379, 401, 409, 419, 433, 443, 449, 457, 467, 491, 499, 521, 523, 547, 563, 569, 571, 577, 587, 593, 601, 617, 619, 641, 643, 659, 673, 683

Offset: 1

N. J. A. Sloane

Sequence naturally partitions into two sequences: all primes p with ord_p(-2) odd (A163183, the primes dividing 2^j +1 for some odd j) and certain primes p with ord_p(-2) even (A163185). - Christopher J. Smyth, Jul 23 2009

Terms m in A047476 with A010051(m) = 1. - Reinhard Zumkeller, Dec 29 2012

David A. Cox, "Primes of the Form x^2 + n y^2", Wiley, 1989.

Ray Chandler, Table of n, a(n) for n = 1..10000 (first 1000 terms from T. D. Noe)
N. J. A. Sloane et al., Binary Quadratic Forms and OEIS (Index to related sequences, programs, references)

Cf. A002332, A002333.
Cf. A039706, A003628 (complement with respect to A000040).
Primes in A002479.
Cf. A051100 (see Mathar's comment).
Apart from leading term the same as A033200.

a033203 n = a033203_list !! (n-1)
a033203_list = filter ((== 1) . a010051) a047476_list
-- Reinhard Zumkeller, Dec 29 2012, Jan 22 2012

[p: p in PrimesUpTo(600) | p mod 8 in [1..3]]; // Vincenzo Librandi, Aug 11 2012

[p: p in PrimesUpTo(800) | NormEquation(2,p) eq true]; // Bruno Berselli, Jul 03 2016

QuadPrimes2[1, 0, 2, 10000] (* see A106856 *)
Select[Prime[Range[200]],MemberQ[{1,2,3},Mod[#,8]]&] (* Harvey P. Dale, Mar 16 2013 *)

is(n)=isprime(n) && issquare(Mod(-2,n)) \\ Charles R Greathouse IV, Nov 29 2016

a(n) = A002332(n) + 2*A002333(n)^2. - Zak Seidov, May 29 2014

A107145 Primes of the form x^2 + 40y^2.

Original entry on oeis.org

41, 89, 241, 281, 401, 409, 449, 521, 569, 601, 641, 761, 769, 809, 881, 929, 1009, 1049, 1129, 1201, 1249, 1289, 1321, 1361, 1409, 1481, 1489, 1601, 1609, 1721, 1801, 1889, 2081, 2089, 2129, 2161, 2281, 2441, 2521, 2609, 2689, 2729, 2801

Offset: 1

T. D. Noe, May 13 2005

Discriminant = -160. See A107132 for more information.

Vincenzo Librandi and Ray Chandler, Table of n, a(n) for n = 1..10000 [First 1000 terms from Vincenzo Librandi]
N. J. A. Sloane et al., Binary Quadratic Forms and OEIS (Index to related sequences, programs, references)

Cf. A139643.

[ p: p in PrimesUpTo(3000) | p mod 40 in {1, 9} ]; // Vincenzo Librandi, Jul 24 2012

QuadPrimes2[1, 0, 40, 10000] (* see A106856 *)

list(lim)=my(v=List(),t); forprime(p=41,lim, t=p%40; if(t==1||t==9, listput(v,p))); Vec(v) \\ Charles R Greathouse IV, Feb 09 2017

The primes are congruent to {1, 9} (mod 40). - T. D. Noe, Apr 29 2008

A033205 Primes of form x^2 + 5*y^2.

Original entry on oeis.org

5, 29, 41, 61, 89, 101, 109, 149, 181, 229, 241, 269, 281, 349, 389, 401, 409, 421, 449, 461, 509, 521, 541, 569, 601, 641, 661, 701, 709, 761, 769, 809, 821, 829, 881, 929, 941, 1009, 1021, 1049, 1061, 1069, 1109, 1129, 1181, 1201, 1229, 1249, 1289, 1301, 1321, 1361, 1381, 1409, 1429, 1481, 1489

Offset: 1

N. J. A. Sloane

It is a classical result that p is of the form x^2 + 5y^2 if and only if p = 5 or p == 1 or 9 mod 20 (see Cox, page 33). - N. J. A. Sloane, Sep 20 2012
Except for 5, also primes of the form x^2 + 25y^2. See A140633. - T. D. Noe, May 19 2008
Or, 5 and all primes p that divide Fibonacci((p - 1)/2) = A121568(n). - Alexander Adamchuk, Aug 07 2006

David A. Cox, "Primes of the Form x^2 + n y^2", Wiley, 1989; see p. 33.

Vincenzo Librandi and Ray Chandler, Table of n, a(n) for n = 1..10000 [First 2000 terms from Vincenzo Librandi]
B. W. Brewer, On primes of the form u^2+5v^2, Am. Math. Monthly vol. 17 no 2 (1966) pp 502-509.
N. J. A. Sloane et al., Binary Quadratic Forms and OEIS (Index to related sequences, programs, references)

Subsequence of A091729.
Primes in A020669 (numbers of form x^2+5y^2). Cf. A121568, A139643, A216815.
Cf. A029718, A106865 (in the same genus).

[p: p in PrimesUpTo(2000) | NormEquation(5,p) eq true]; // Bruno Berselli, Jul 03 2016

QuadPrimes2[1, 0, 5, 10000] (* see A106856 *)

is(n)=my(k=n%20); n==5 || ((k==9 || k==9) && isprime(n)) \\ Charles R Greathouse IV, Feb 09 2017

A020669 INTERSECT A000040.

a(n) ~ 4n log n. - Charles R Greathouse IV, Nov 09 2012

cp's OEIS Frontend

A139827 Primes of the form 2x^2 + 2xy + 17y^2.

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

Magma

Mathematica

PARI

Formula

A107132 Primes of the form 2x^2 + 13y^2.

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

Mathematica

PARI

A140633 Primes of the form 7x^2+4xy+52y^2.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

A139643 Primes of the form x^2+Ny^2, with N=102.

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

Magma

Magma

Maple

Mathematica

A033212 Primes congruent to 1 or 19 (mod 30).

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

Mathematica

PARI

PARI

Formula

Extensions

A107152 Primes of the form x^2 + 45y^2.

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

Magma

Mathematica

PARI

Formula

A107008 Primes of the form x^2 + 24*y^2.

Views

Author

Keywords

Comments

Links