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.
Do[p=n^n+n-1; If[PrimeQ[p], Print[p]], {n, 100}]
lista(nn) = for(k=1, nn, if(ispseudoprime(q=k^k+k-1), print1(q, ", "))); \\ Jinyuan Wang, Mar 01 2020
[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
a(2) = 2 because 2^2 + 2 + 1 = 7.
Do[ If[ PrimeQ[ n^n + n + 1], Print[n]], {n, 1, 700} ]
Join[{0},Select[Range[470],PrimeQ[#^#+#+1]&]] (* Harvey P. Dale, Dec 11 2022 *)
f2(n,k) = for(x=1,n,y=x^x+x+k;if(ispseudoprime(y),print1(x","))) \\ Cino Hilliard, Jan 07 2005
ABC2 $a^$a + $a + 1 a: from 0 to 1000 // Jinyuan Wang, Mar 01 2020
Do[ If[ PrimeQ[ n^n - n - 1], Print[n]], {n, 1, 750} ]
is(n)=ispseudoprime(n^n-n-1) \\ Charles R Greathouse IV, May 22 2017
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