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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A205546 Least positive integer k such that n divides k^k-j^j for some j in [1,k-1]. 3
 2, 3, 2, 4, 4, 4, 4, 6, 4, 6, 5, 4, 3, 4, 4, 6, 4, 4, 5, 6, 4, 5, 3, 8, 6, 3, 6, 4, 6, 8, 6, 6, 6, 8, 6, 4, 7, 9, 8, 6, 9, 4, 6, 5, 8, 8, 10, 8, 8, 6, 4, 9, 9, 9, 8, 8, 8, 6, 9, 8, 10, 12, 4, 6, 8, 9, 9, 8, 8, 8, 5, 10, 10, 9, 12, 9, 8, 9, 9, 6, 9, 9, 18, 4, 4, 16, 7, 8, 8, 12, 8, 8, 12, 10 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS For a guide to related sequences, see A204892. LINKS EXAMPLE 1 divides 2^2-1^1 -> k=2, j=1 2 divides 3^3-1^1 -> k=3, j=1 3 divides 2^2-1^1 -> k=2, j=1 4 divides 4^4-2^2 -> k=2, j=2 MATHEMATICA s = Table[n^n, {n, 1, 120}]; lk = Table[NestWhile[# + 1 &, 1,    Min[Table[Mod[s[[#]] - s[[j]], z], {j, 1, # - 1}]] =!= 0 &], {z, 1, Length[s]}] Table[NestWhile[# + 1 &, 1,   Mod[s[[lk[[j]]]] - s[[#]], j] =!= 0 &], {j, 1, Length[lk]}] (* Peter J. C. Moses, Jan 27 2012 *) CROSSREFS Cf. A204892, A000312. Sequence in context: A235805 A168231 A235728 * A081315 A035662 A249870 Adjacent sequences:  A205543 A205544 A205545 * A205547 A205548 A205549 KEYWORD nonn AUTHOR Clark Kimberling, Jan 31 2012 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 September 19 11:33 EDT 2021. Contains 347556 sequences. (Running on oeis4.)