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.
Join[{0}, Select[Range[1, 175, 2], PrimeQ[2*11^# + 1] &]] (* Arkadiusz Wesolowski, Nov 06 2012 *)
for(n=0, 1e5, if(isprime(2*11^n + 1), print1(n", "))) \\ Altug Alkan, Oct 16 2015
is(n) = ispseudoprime(2*17^n + 1); \\ Altug Alkan, Jan 10 2016
is(n)=ispseudoprime(2*29^n+1) \\ Charles R Greathouse IV, Jun 06 2017
[n : n in [0..10^3] | IsPrime(2*71^n+1)]; // Arkadiusz Wesolowski, Jul 29 2011
Select[Range[0, 10^3], PrimeQ[2*71^# + 1] &] (* Arkadiusz Wesolowski, Jul 29 2011 *)
for(n=0, 10^3, if(isprime(2*71^n+1), print1(n, ", "))) \\ Arkadiusz Wesolowski, Jul 29 2011
Comments