This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
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
Union[QuadPrimes2[7, 4, 52, 10000], QuadPrimes2[7, -4, 52, 10000]] (* see A106856 *)
a(1)=1 because the primes represented by x^2+xy+y^2 are the same as the primes represented by x^2 + 3*y^2 (see A007645).
The known pairs (n,m) are the following (checked for range n<=200 and m<=500):
n={1, 4, 4, 6, 6, 7, 8, 8, 10, 10, 10, 14, 14, 14, 16, 18, 22, 22, 26, 38, 38}
m={3, 9, 12, 8, 16, 15, 45, 60, 24, 48, 72, 24, 48, 72, 21, 40, 120, 240, 168, 120, 240}.
f = 200; g = 300; h = 30; j = 100; b = {}; Do[a = {}; Do[Do[If[PrimeQ[x^2 + n y^2], AppendTo[a, x^2 + n y^2]], {x, 0, g}], {y, 1, g}]; AppendTo[b, Take[Union[a], h]], {n, 1, f}]; Print[b]; c = {}; Do[a = {}; Do[Do[If[PrimeQ[n^2 + w*n*m + m^2], AppendTo[a, n^2 + w*n*m + m^2]], {n, m, g}], {m, 1, g}]; AppendTo[c, Take[Union[a], h]], {w, 1, j}]; Print[c]; bb = {}; cc = {}; Do[Do[If[b[[p]] == c[[q]], AppendTo[bb, p]; AppendTo[cc, q]], {p, 1, f}], {q, 1, j}]; Union[cc] (*Artur Jasinski*)
a(3)=71 because we can write 71=-1^2+6*1*3+6*3^2 (or 71=11*1^2+18*1*2+6*2^2).
Reap[For[p = 2, p < 3000, p = NextPrime[p], If[FindInstance[p == -x^2 + 6*x*y + 6*y^2, {x, y}, Integers, 1] =!= {}, Print[p]; Sow[p]]]][[2, 1]] (* Jean-François Alcover, Oct 25 2016 *)
a(3)=17 because we can write 17=2*2^2+6*2*1-3*1^2 (or 17=5*1^2+10*1*1+2*1^2).
Select[Prime[Range[500]], # == 2 || # == 5 || MatchQ[Mod[#, 60], 17|53]&] (* Jean-François Alcover, Oct 28 2016 *)
a(3)=43 because we can write 43=-2*1^2+6*1*3+3*3^2 (or 43=7*1^2+12*1*2+3*2^2).
Select[Prime[Range[500]], # == 3 || MatchQ[Mod[#, 60], 7|43]&] (* Jean-François Alcover, Oct 28 2016 *)
19 is a member because we can write 19=4*2^2+4*2*1-5*1^2 (or 19=4*1^2+12*1*1+3*1^2).
[3] cat [ p: p in PrimesUpTo(3000) | p mod 24 in {19 } ]; // Vincenzo Librandi, Jul 24 2012
QuadPrimes2[3, 0, 16, 10000] (* see A106856 *)
list(lim)=my(v=List(),w,t); for(x=1, sqrtint(lim\3), w=3*x^2; for(y=0, sqrtint((lim-w)\16), if(isprime(t=w+16*y^2), listput(v,t)))); Set(v) \\ Charles R Greathouse IV, Feb 09 2017
Reap[For[n = 0, n <= 200, n++, If[Reduce[ 1*x^2 + 6*x*y - 6*y^2 == n, {x, y}, Integers] =!= False, Sow[n]]]][[2, 1]]
a(1) = 7 because we can write 7 = 1^2 + 5*1*1 + 1^2.
a = {}; w = 5; 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]
# uses[binaryQF] # The function binaryQF is defined in the link 'Binary Quadratic Forms'. Q = binaryQF([1, 5, 1]) print(Q.represented_positives(1303, 'prime')) # Peter Luschny, May 12 2021
Comments