login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A123701 Minimum number k>0 such that Abs[n^k - k^n] = A078202[n] is prime; or -1 if such k>0 does not exist. 1
3, 5, 1, 1, 2, 1, 2, 1, 2, 3, 8, 1, 6, 1, 68, -1, 2, 1, 2, 1, 32 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

COMMENTS

A078202[n] is the smallest prime of the form abs(n^k - k^n), the absolute difference between n^k and k^n, or -1 if no such prime exists. A078202[n] = {2, 7, 2, 3, 7, 5, 79, 7, 431, 58049, 8375575711, 11, 13055867207, 13, 94233563770233419658037661865757455268745312881861761180195872329157714108064193, -1, 130783, 17, ...}. a(n) = -1 for n = {16,64,...} when A078202[n] = -1. a(n) = 1 for n = {3,4,6,8,12,14,18,20,...} = A008864[n] Primes + 1, when A078202[p+1] = p. Currently a(n) is not known for n = {22,27,28,33,36,37,39,40,46,55,56,57,59,...}. a(23)-a(26) = {60,1,12,5}. a(29)-a(32) = {98,1,42,1}. a(34)-a(35) = {69,6}. a(38) = 1. a(41)-a(45) = {60,1,32,1,44}. a(47)-a(54) = {110,1,24,9,2,3,2,1}. a(58) = 93. a(60)-a(64) = {1,180,1,88,-1}.

MATHEMATICA

f[n_] := Block[{k = If[EvenQ@n || n < 4, 1, 2]}; While[ ! PrimeQ@Abs[n^k - k^n], k += 2]; k] (* Robert G. Wilson v *)

CROSSREFS

Cf. A078202, A008864, A122735.

Sequence in context: A091717 A154512 A030588 * A074903 A143303 A091084

Adjacent sequences:  A123698 A123699 A123700 * A123702 A123703 A123704

KEYWORD

hard,more,sign

AUTHOR

Alexander Adamchuk (alex(AT)kolmogorov.com), Oct 08 2006

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 14 18:33 EST 2012. Contains 205663 sequences.