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
a:=proc(n) if isprime(2^n+n+1)=true then 2^n+n+1 else fi end: seq(a(n),n=0..1000); # Emeric Deutsch, May 13 2006
{ta={{0}}, tb={{0}}};Do[g=n;s=2^n+n+1; If[PrimeQ[s], Print[n];ta=Append[ta, n]; tb=Append[tb, s]], {n, 1, 10000}];{ta, tb, g} (* Labos Elemer, Nov 19 2004 *)
A100361:=n->`if`(isprime(2^n-n+1), n, NULL): seq(A100361(n), n=0..10^3); # Wesley Ivan Hurt, Oct 13 2014
{ta={{0}}, tb={{0}}};Do[g=n;s=2^n-n+1; If[PrimeQ[s], Print[n];ta=Append[ta, n]; tb=Append[tb, s]], {n, 1, 10000}];{ta, tb, g}
is(n)=ispseudoprime(2^n-n+1) \\ Charles R Greathouse IV, Feb 20 2017
[ a: n in [0..200] | IsPrime(a) where a is 2^n-n+1 ]; // Vincenzo Librandi, Jul 18 2012
Select[Table[2^n-n+1,{n,0,500}],PrimeQ] (* Vincenzo Librandi, Jul 18 2012 *)
def list_a(k): return [(2**i) - i + 1 for i in range(k) if (2**i) - i + 1 in Primes()] # Giuseppe Bonaccorso, Aug 15 2019
[ a: n in [0..250] | IsPrime(a) where a is 2^n + n^2 + 1 ] // Vincenzo Librandi, Sep 03 2012
Select[Table[2^n + n^2 + 1, {n, 0, 300, 6}], PrimeQ ] (* Vincenzo Librandi, Sep 03 2012 *)
{ta={{0}}, tb={{0}}};Do[g=n;s=2^n+n+1; If[PrimeQ[s], Print[n];ta=Append[ta, n]; tb=Append[tb, s]], {n, 1, 10000}];{ta, tb, g}
is(n)=ispseudoprime(2^n+n+1) \\ Charles R Greathouse IV, Feb 20 2017
A100358:=n->`if`(isprime(2^n+n^3+1),n,NULL): seq(A100358(n), n=0..10^3); # Wesley Ivan Hurt, Sep 01 2014
{ta={{0}}, tb={{0}}}; Do[g=n;s=2^n+n^3+1;If[PrimeQ[s], Print[n];ta=Append[ta, n];tb=Append[tb, s]], {n, 1, 10000}];{ta, tb, g}
for(n=1,10^5,if(ispseudoprime(2^n+n^3+1),print1(n,", "))) \\ Derek Orr, Sep 01 2014
[k: k in [0..400] | IsPrime(7^k + k^7 + 1)];
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[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
Comments