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.
lst={};Do[p=n^n+7;If[PrimeQ[p],AppendTo[lst,n]],{n,2*5!}];lst (* Vladimir Joseph Stephan Orlovsky, Nov 01 2009 *)
Select[Range[35],PrimeQ[#^#+7]&] (* Harvey P. Dale, Oct 27 2018 *)
f1(n,a) = for(x=0,n,y=x^x+a;if(ispseudoprime(y),print1(y",")))
Prepend[Select[Range[100], PrimeQ[#^# + 10] &], 0] (* Stefan Steinerberger, Mar 15 2006 *)
f1(n,a) = for(x=0,n,y=x^x+a;if(ispseudoprime(y),print1(y",")))
2^2 + 43 = 47, which is prime, so 2 is in the sequence.
f[n_]:=PrimeQ[n^n+43];lst={};Do[If[f[n],AppendTo[lst,n]],{n,6!}];lst
is(n)=ispseudoprime(n^n+43) \\ Charles R Greathouse IV, Jun 13 2017
lst={};Do[p=n^n+4;If[PrimeQ[p],AppendTo[lst,p]],{n,5!}];lst (* Vladimir Joseph Stephan Orlovsky, Nov 01 2009 *)
Select[Table[n^n+4,{n,50}],PrimeQ] (* Harvey P. Dale, Oct 09 2020 *)
f1(n) = for(x=1,n,y=x^x+4;if(ispseudoprime(y),print1(y", ")))
isok(k) = ispseudoprime(k^k + 9); \\ Altug Alkan, Mar 16 2018
Select[Range[1000], PrimeQ[#^# - 5] &] (* Vaclav Kotesovec, Mar 25 2018 *)
isok(k) = ispseudoprime(k^k - 5); \\ Altug Alkan, Mar 17 2018
Select[Range[1000], PrimeQ[#^# - 10] &] (* Vaclav Kotesovec, Mar 25 2018 *)
isok(k) = ispseudoprime(k^k - 10); \\ Altug Alkan, Mar 17 2018
f[n_]:=PrimeQ[n^n+115];lst={};Do[If[f[n],AppendTo[lst,n]],{n,6!}];lst
is(n)=ispseudoprime(n^n+115) \\ Charles R Greathouse IV, Jun 13 2017
Comments