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.
Select[Table[p^2 + 10, {p, Prime[Range[200]]}], PrimeQ] (* T. D. Noe, May 01 2012 *)
a(1) = 2 since 2 = 1*(1+1)/2 + 1^2. a(2) = 3 since 3 = 2*(2+1)/2 + 0^2.
TQ[n_]:=IntegerQ[Sqrt[8n+1]]
n=0
Do[Do[If[TQ[Prime[k]-x^2],n=n+1;Print[n," ",Prime[k]];Goto[aa]],{x,0,Sqrt[Prime[k]]}];
Label[aa];Continue,{k,1,100}]
istrg(n) = {if (! issquare(8*n+1), return (0)); return (1);}
isok(p) = {for (i = 0, sqrtint(p), if (istrg(p-i^2), return (1)););}
lista(nn) = {forprime(p=2, nn, if (isok(p), print1(p, ", ")););}
list(lim)=my(v=List(if(lim<3,[],[3]))); for(m=1,(sqrtint((lim\=1)*8+1)-1)\2, my(t=m*(m+1)/2); for(s=1,sqrtint(lim-t), my(p=t+s^2); if(isprime(p), listput(v,p)))); Set(v) \\ Charles R Greathouse IV, Aug 28 2024
[a: n in [0..1000] | IsPrime(a) where a is n^2+14];
Select[Table[n^2 + 14, {n, 0, 2000}], PrimeQ]
Select[Range[1,1001,2]^2+14,PrimeQ] (* Harvey P. Dale, May 30 2023 *)
Comments