|
|
A241427
|
|
Smallest prime of the form n^k - k^n for some k, or 0 if no such prime exists.
|
|
1
|
|
|
|
OFFSET
|
2,1
|
|
COMMENTS
|
Conjecture: a(n) > 0 for all n not in A097764.
More terms in b-file. If n > 4 and in A097764, n^k - k^n is factorable and won't be prime.
a(17) > 17^7500 - 7500^17. See A239279.
|
|
LINKS
|
|
|
PROG
|
(PARI)
a(n)=k=1; if(n>4, forprime(p=1, 100, if(ispower(n)&&ispower(n)%p==0&&n%p==0, return(0)); if(n%p==n, break))); k=1; while(!ispseudoprime(n^k-k^n), k++); return(n^k-k^n)
vector(15, n, a(n+1))
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|