|
|
A073825
|
|
Numbers n such that Sum_{k=1..n} k^k is prime.
|
|
5
|
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
Any additional terms are greater than 1320 with the next prime having more than 4120 digits.
No terms out to 3000. The next term would yield a prime with over 10000 digits. - John Sillcox (johnsillcox(AT)hotmail.com), Aug 05 2003
For every n, a(n) must be equal to 1 or 2 (mod 4) because Sum[k^k,{k,a(n)}] must be odd. Any additional terms are greater than 5368 with the next prime having more than 20025 digits. - Farideh Firoozbakht, Aug 09 2003
Soundararajan finds an asymptotic upper bound of log k / log log k prime numbers of the form 1^1 + 2^2 + ... + n^n less than k; that is, n << log a(n) / log log a(n). - Charles R Greathouse IV, Aug 27 2008
According to Andersen, the next term is larger than 28000, see Rivera link. - M. F. Hasler, Mar 01 2009
Conjecture: This sequence is infinite. - Daniel Hoying, Jul 20 2020
|
|
LINKS
|
|
|
FORMULA
|
|
|
MATHEMATICA
|
v={}; Do[If[(Mod[n, 4]==1||Mod[n, 4]==2)&&PrimeQ[Sum[k^k, {k, n}]], v=Insert[v, n, -1]; Print[v]], {n, 5368}]
|
|
PROG
|
(PARI) s=0; for(k=1, 1320, s=s+k^k; if(isprime(s), print1(k, ", ")))
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|