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
[n^n+n-1 : n in [0..20]]; // Wesley Ivan Hurt, Sep 23 2014
A231712:=n->n^n+n-1: seq(A231712(n), n=0..20); # Wesley Ivan Hurt, Sep 23 2014
Join[{0}, Table[n^n + n - 1, {n, 18}]]
a(n)=n^n+n-1 \\ Edward Jiang, Sep 06 2014
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
[a: n in [0..100] | IsPrime(a) where a is n^(n+1)+n-1]; // Vincenzo Librandi, Feb 17 2016
Select[Table[n^(n + 1) + n - 1, {n, 1, 50}], ProvablePrimeQ[#] &]
lista(nn) = for(k=1, nn, if(ispseudoprime(q=k^(k+1)+k-1), print1(q, ", "))); \\ Jinyuan Wang, Mar 01 2020
For k = 3, k^k + k^2 + 3*k + 2 = 47 and 47 is prime.
isok(k) = ispseudoprime(k^k + k^2 + 3*k + 2); \\ Michel Marcus, Sep 10 2022
If k = 2, then k^k + k^2 + k*2 + 1 = 2^2 + 2^2 + 2*2 + 1 = 13, which is prime.
Comments