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[Range[0, 5000], PrimeQ[11^# + #^11 + 1] &]
is(n)=isprime(11^n+n^11+1) \\ Charles R Greathouse IV, Feb 17 2017
[n: n in [0..1000] | IsPrime(2^n+n^2-1)]
Select[Range[0, 9000], PrimeQ[2^# + #^2 - 1] &]
is(n)=ispseudoprime(2^n+n^2-1) \\ Charles R Greathouse IV, May 22 2017
Select[Range[0, 5000], PrimeQ[7^# + #^7 - 1] &]
is(n)=ispseudoprime(7^n+n^7-1) \\ Charles R Greathouse IV, Jun 06 2017
Select[Range[0, 5000], PrimeQ[4^# + #^4 + 1] &]
is(n)=ispseudoprime(4^n+n^4+1) \\ Charles R Greathouse IV, Jun 06 2017
[n: n in [0..1000] | IsPrime(13^n+n^13-1)];
Select[Range[0, 5000], PrimeQ[13^# + #^13 - 1] &]
is(n)=ispseudoprime(13^n+n^13-1) \\ Charles R Greathouse IV, Jun 13 2017
Select[Range[0, 5000], PrimeQ[13^# + #^13 + 1] &]
is(n)=ispseudoprime(13^n+n^13+1) \\ Charles R Greathouse IV, Jun 13 2017
Select[Range[0, 5000], PrimeQ[19^# + #^19 - 1] &]
is(n)=ispseudoprime(19^n+n^19-1) \\ Charles R Greathouse IV, Jun 13 2017
[n: n in [0..800] | IsPrime(4^n+n^4-1)];
Select[Range[0, 5000], PrimeQ[4^# + #^4 - 1] &]
is(n)=ispseudoprime(4^n+n^4-1) \\ Charles R Greathouse IV, Jun 13 2017
[n: n in [0..1000] | IsPrime(6^n+n^6-1)];
Select[Range[0, 10000], PrimeQ[6^# + #^6 - 1] &]
is(n)=ispseudoprime(6^n+n^6-1) \\ Charles R Greathouse IV, Jun 13 2017
Select[Range[0, 4000],PrimeQ[8^# + #^8 - 1] &]
is(n)=ispseudoprime(8^n+n^8-1) \\ Charles R Greathouse IV, Jun 13 2017
Comments