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.
For[n = 1, n < 1000, n++, If[ PrimeQ[n^n + 4], Print[n]]] (* Stefan Steinerberger, Apr 02 2006 *)
f1(n,a) = for(x=0,n,y=x^x+a;if(ispseudoprime(y),print1(y",")))
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",")))
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
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
1^1 + 10 = 11, which is prime, so 11 is in the sequence. 3^3 + 10 = 27 + 10 = 37, which is also prime, so 37 is also in the sequence. 5^5 + 10 = 3125 + 10 = 3135 = 3 * 5 * 11 * 19, so 3135 is not in the sequence.
Select[Table[n^n + 10, {n, 100}], PrimeQ] (* Alonso del Arte, Aug 05 2019 *)
f1(n) = for(x=1,n,y=x^x+10;if(ispseudoprime(y),print1(y", ")))
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