The OEIS is supported by the many generous donors to the OEIS 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 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A269665 For n>=0, let A_n be the set of natural numbers k such that (k^n + 1) | k!. If A is nonempty, then a(n) is the least element of A_n; otherwise a(n) = 0. 1
 2, 5, 18, 17, 1600, 984, 2888, 460747, 99271723, 792174, 32917926 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,1 COMMENTS a(n) is the smallest k such that (k^n + 1) | k! if it exists, otherwise a(n) = 0. LINKS Table of n, a(n) for n=0..10. EXAMPLE For n=2, a(2) is equal to 18 because k=18 is the least natural number k such that (k^2+1)|k! (see A120416). MATHEMATICA For[k = 0, k < 11, k++, x = 0; r = 0; n = 1; While[x != 1, If[Mod[n!, n^k + 1] != 0, x = 0, x = 1; r = n]; n++]; Print[r]] Table[SelectFirst[Range[10^4], Divisible[#!, #^n + 1] &], {n, 0, 6}] (* Michael De Vlieger, Mar 04 2016, Version 10 *) PROG (PARI) a(n) = {my(k = 1); while (k! % (k^n+1), k++); k; } \\ Michel Marcus, Mar 03 2016 CROSSREFS Cf. A118742, A120416, A270441. Sequence in context: A226069 A258429 A117839 * A080689 A026321 A288994 Adjacent sequences: A269662 A269663 A269664 * A269666 A269667 A269668 KEYWORD nonn,more AUTHOR José Hernández, Mar 02 2016 EXTENSIONS a(7)-a(9) from Hiroaki Yamanouchi, Apr 04 2016 a(10) from Giovanni Resta, Apr 20 2016 STATUS approved

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

Last modified December 9 09:12 EST 2023. Contains 367690 sequences. (Running on oeis4.)