OFFSET
1,1
COMMENTS
Are all terms == 1 mod 12? - Zak Seidov, Apr 25 2008
Yes: (i) all terms == 1 mod 3 because the quadratic form has terms == {0,1} mod 3 and the values ==0 mod 3 are not primes. (ii) all terms == 1 mod 4 because the quadratic form has terms == {0,1,2} mod 4 and the values = {0,2} mod 4 are not primes. By the Chinese remainder constructions for coprime 3 and 4 all prime terms are == 1 mod 12. - R. J. Mathar, Jun 10 2020
LINKS
Robert Israel, 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), discriminant 1020.
MAPLE
N:= 10^4: # for terms <= N
R:= {}:
for x from 0 by 2 while x^2 <= N do
R:= R union select(isprime, {seq(x^2 + 32*x*y + y^2, y = 1 .. floor(sqrt(255*x^2+N))-16*x, 2)})
od:
sort(convert(R, list)); # Robert Israel, May 31 2026
MATHEMATICA
a = {}; w = 32; k = 1; Do[Do[If[PrimeQ[n^2 + w*n*m + k*m^2], AppendTo[a, n^2 + w*n*m + k*m^2]], {n, m, 400}], {m, 1, 400}]; Union[a] (*Artur Jasinski*)
CROSSREFS
KEYWORD
nonn
AUTHOR
Artur Jasinski, Apr 24 2008
STATUS
approved
