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.
forprime(p=1, oo, c=0; for(i=1, 12, if(ispseudoprime(p+(2*i)^2), c++)); if(c==12, print1(p, ", "))) \\ Derek Orr, Sep 11 2014
Select[Prime[Range[35000]],AllTrue[#+{4,16,36,64,100,144,196,256,324,400,484,576,676},PrimeQ]&] (* The program generates the first two terms of the sequence. To generate a(3) and a(4), increase the Range constant to 67*10^10 but the program will take a very long time to run. *) (* Harvey P. Dale, Mar 05 2025 *)
forprime(p=1, 10^12, c=0; for(i=1, 13, if(ispseudoprime(p+(2*i)^2), c++);if(!ispseudoprime(p+(2*i)^2),break)); if(c==13, print1(p, ", "))) \\ Derek Orr, Sep 11 2014
Comments