Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #21 Sep 08 2022 08:45:33
%S 1321,1489,1609,2161,2281,2689,3001,3169,3529,4129,4801,5281,5449,
%T 5569,5641,6121,6361,6961,7129,7489,7561,7681,8089,8209,8761,9001,
%U 9241,9601,9769,10321,10729,12049,12241,12409,12721,12841,13249,13729
%N Primes of the form x^2 + 1320*y^2.
%C Discriminant = -5280. See A139643 for more information.
%C The primes are congruent to {1, 49, 169, 289, 361, 529, 841, 889, 961, 1081} (mod 1320).
%H Vincenzo Librandi and Ray Chandler, <a href="/A139666/b139666.txt">Table of n, a(n) for n = 1..10000</a> (first 1000 terms from Vincenzo Librandi).
%H N. J. A. Sloane et al., <a href="https://oeis.org/wiki/Binary_Quadratic_Forms_and_OEIS">Binary Quadratic Forms and OEIS</a> (Index to related sequences, programs, references)
%t QuadPrimes2[1, 0, 1320, 10000] (* see A106856 *)
%o (Magma) [ p: p in PrimesUpTo(15000) | p mod 1320 in {1, 49, 169, 289, 361, 529, 841, 889, 961, 1081}]; // _Vincenzo Librandi_, Jul 29 2012
%o (Magma) k:=1320; [p: p in PrimesUpTo(14000) | NormEquation(k, p) eq true]; // _Bruno Berselli_, Jun 01 2016
%K nonn,easy
%O 1,1
%A _T. D. Noe_, Apr 29 2008