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.
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
a(2) = 5^5 - 5 + 1 = 3125 - 4 = 3121.
Unprotect[Power]; Power[0, 0] = 1; Protect[Power]; Select[Table[n^n - n + 1, {n, 0, 100}], PrimeQ] (* T. D. Noe, Apr 27 2012 *)
[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
23 is a term because 3^3 + 3*(-1) + (-1)^(-1) = 23 is prime. 31 is a term because 3^3 + 3*1 + 1^1 = 31 is prime. 37 is a term because 3^3 + 3*2 + 2^2 = 37 is prime.
Comments