cp's OEIS Frontend

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.

Showing 1-1 of 1 results.

A241427 Smallest prime of the form n^k - k^n for some k, or 0 if no such prime exists.

Original entry on oeis.org

7, 2, 3, 6102977801, 5, 79792265017612001, 7, 2486784401
Offset: 2

Views

Author

Derek Orr, Aug 08 2014

Keywords

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.

Crossrefs

Cf. A078201.

Programs

  • 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))
Showing 1-1 of 1 results.