This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A075368 Smallest integer value of LCM(n+1, n+2, ..., n+k) (for k >= 0) divided by the product of all the primes up to n. 3
 1, 6, 10, 5, 84, 84, 1716, 858, 286, 286, 100776, 100776, 891480, 891480, 891480, 445740, 282861360, 282861360, 550835280, 550835280, 550835280, 550835280, 42222721680, 42222721680, 8444544336, 8444544336, 2814848112, 2814848112 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS FORMULA a(n) = A075367(n)/A034386(n). MATHEMATICA a75365[n_] := Module[{div, k, pr}, div=Times@@Prime/@Range[PrimePi[n]]; For[k=0; pr=1, True, k++; pr*=n+k, If[Mod[pr, div]==0, Return[k]]]]; a[1]=1; a[n_] := LCM@@Range[n+1, n+a75365[n]]/Times@@Prime/@Range[PrimePi[n]] CROSSREFS Cf. A075365, A075366, A075367. Sequence in context: A052193 A144763 A083478 * A074288 A156383 A010726 Adjacent sequences:  A075365 A075366 A075367 * A075369 A075370 A075371 KEYWORD nonn AUTHOR Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Sep 20 2002 EXTENSIONS Edited by Dean Hickerson (dean.hickerson(AT)yahoo.com), Oct 28 2002 STATUS approved

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 .