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[Table[2n^n+1,{n,20}],PrimeQ] (* Harvey P. Dale, Mar 27 2016 *)
for(n=1,999, ispseudoprime(p=n^n*2+1) & print1(p","))
3 is in the sequence since 2*3^3 - 1 = 53 is prime.
[n: n in [0..500] | IsPrime(2*n^n-1)]; // Vincenzo Librandi, Nov 01 2014
Select[Range[1000], PrimeQ[2*#^# - 1] &] (* Vaclav Kotesovec, Oct 31 2014 *)
for(n=1,2000,1;if(isprime(2*n^n-1),print(n))) \\ Ray G. Opao, Oct 23 2014
Flatten[{0, Select[Range[1000], PrimeQ[4*#^# + 3] &]}] (* Vaclav Kotesovec, Mar 25 2018 *)
for(n=0, 100, if(isprime(4*n^n+3), print1(n", ")))
a(1) = 1, because 2^2*3+1 = 13 is the smallest prime of this form. a(2) = 2, because 4^4*3+1 = 769 is the next smallest prime of this form. a(3) = 3, because 6^6*3+1 = 139969 is again a prime.
q:= k-> isprime(3*(2*k)^(2*k)+1): select(q, [$1..225])[]; # Alois P. Heinz, Aug 04 2025
for(i=1,9999,ispseudoprime(i^i*3+1)&print1(i/2,","))
sp[n_]:=Module[{n2=n^n,k=1},While[!PrimeQ[k*n2+1],k++];k*n2+1]; Array[ sp,20] (* Harvey P. Dale, Jul 06 2014 *)
Flatten[{0, Select[Range[1000], PrimeQ[4*#^# + 1] &]}] (* Vaclav Kotesovec, Mar 25 2018 *)
for(n=0, 100, if(isprime(4*n^n+1), print1(n", ")))
Flatten[{0, Select[Range[1000], PrimeQ[16*#^# + 1] &]}] (* Vaclav Kotesovec, Mar 25 2018 *)
for(n=0, 1000, if(isprime(16*n^n+1), print1(n", ")))
for(n=0, 500, if(isprime(6*n^n+5), print1(n", ")))
Select[Range[1, 1000], PrimeQ[5*#^# + 4] &] (* Vaclav Kotesovec, Apr 01 2018 *)
for(n=0, 500, if(isprime(5*n^n+4), print1(n", ")))
lista(nn) = forstep(n=1, nn, 2, if(ispseudoprime(5*n^n+4), print1(n, ", "))); \\ Altug Alkan, Apr 01 2018
Comments