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.
3 is a term because 3^3 + 3 - 1 = 29.
Do[ If[ PrimeQ[ n^n + n - 1], Print[n]], {n, 1, 750} ]
is(n)=ispseudoprime(n^n+n-1) \\ Charles R Greathouse IV, Feb 20 2017
Unprotect[Power]; Power[0, 0] = 1; Protect[Power]; lst={}; Do[p=n^n+n+1; If[PrimeQ[p], AppendTo[lst,p]], {n,0,100}]; lst
Join[{2},Select[Table[k^k+k+1,{k,1000}],PrimeQ]] (* Harvey P. Dale, Oct 09 2022 *)
lista(nn) = for(k=0, nn, if(ispseudoprime(q=k^k+k+1), print1(q, ", "))); \\ Jinyuan Wang, Mar 01 2020
select(n -> isprime(n^n-n+1), [$1..3000]); # Robert Israel, Dec 29 2014
Do[If[PrimeQ[n^n-n+1], Print[n]], {n, 1, 3000}]
is(n)=ispseudoprime(n^n-n+1) \\ Charles R Greathouse IV, Jun 13 2017
[n for n in (1..155) if (n^n-n+1).is_prime(proof=True)] # deterministic test
[n for n in (1..5000) if (n^n-n+1).is_prime(proof=False)] # probabilistic test Giuseppe Coppoletta, Dec 26 2014
Comments