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(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
8^0 + 0^8 + 1 = 2, which is prime, so 0 is in the sequence.
Select[Range[0, 10000], PrimeQ[8^# + #^8 + 1] &]
is(n)=ispseudoprime(8^n+n^8+1) \\ Charles R Greathouse IV, Jun 13 2017
Comments