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 60, we have over 367,000 sequences, and we’ve crossed 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!)
 A061243 a(n) = n+r where r is the smallest number such that n divides (n+1)(n+2)(n+3)...(n+r). 3
 2, 4, 6, 8, 10, 9, 14, 12, 15, 15, 22, 16, 26, 21, 20, 22, 34, 24, 38, 25, 28, 33, 46, 28, 35, 39, 36, 35, 58, 35, 62, 40, 44, 51, 42, 42, 74, 57, 52, 45, 82, 49, 86, 55, 51, 69, 94, 54, 63, 60, 68, 65, 106, 63, 66, 63, 76, 87, 118, 65, 122, 93, 70, 72, 78, 77, 134, 85, 92 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS It is conjectured that a(n) = n + A002034(n). Dean Hickerson remarks (Oct 07 2001) that the above conjecture is easy to prove: (n+1)(n+2)...(n+r) is congruent to r! (mod n), so n divides (n+1)(n+2)...(n+r) if and only if n divides r!. LINKS Table of n, a(n) for n=1..69. FORMULA a(n) = n + A002034(n). EXAMPLE a(6) = 9 as 6 divides 7 * 8 * 9 but does not divide 7 * 8. MATHEMATICA a[n_] := For[r=1, True, r++, If[Mod[r!, n]==0, Return[n+r]]] CROSSREFS Cf. A002034. Sequence in context: A082191 A319806 A055952 * A079431 A081472 A097660 Adjacent sequences: A061240 A061241 A061242 * A061244 A061245 A061246 KEYWORD nonn AUTHOR Amarnath Murthy, Apr 23 2001 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 2 02:40 EST 2023. Contains 367505 sequences. (Running on oeis4.)