The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A122735 Smallest prime of the form (n^k - k^n) for k > 1, or 1 if no such prime exists. 4
 1, 7, 17, 1, 6102977801, 162287, 79792265017612001, 8375575711, 2486784401 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS a(10) = 10^273 - 273^10 is too large to include. a(16) = 1 because primes of the form (16^k - k^16) do not exist, since 16^k - k^16 = (4^k - k^4)(4^k + k^4). The corresponding numbers k such that a(n) = (n^k - k^n) are listed in A128355, where k = 0 corresponds to a(n) = 1. Currently a(n) is not known for n = {17, 18, 22, 25, 26, 27, 28, ...}. LINKS EXAMPLE a(1) = 1 because (1^k - k^1) = (1 - k) < 0 for k > 1. a(2) = 7 because 2^5 - 5^2 = 7 is prime, but (2^k - k^2) is not prime for 1 < k < 5, (2^2 - 2^2) = 0, (2^3 - 3^2) = -1, (2^4 - 4^2) = 0. a(4) = 1 because no prime of the form (4^k - k^4) exists; 4^k - k^4 = (2^k - k^2)*(2^k + k^2). a(12) = 83695120256591 = 12^13 - 13^12 = A024152(A122003(2)). CROSSREFS Cf. A024152, A122003. Cf. A128355. Sequence in context: A101122 A090535 A107778 * A094464 A224795 A138449 Adjacent sequences:  A122732 A122733 A122734 * A122736 A122737 A122738 KEYWORD nonn AUTHOR Alexander Adamchuk, Sep 24 2006, corrected Mar 03 2007 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 5 15:06 EST 2021. Contains 349557 sequences. (Running on oeis4.)