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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A075367 Smallest value of lcm(n+1, n+2, ..., n+k) (for k >= 0) that is divisible by the product of all the primes up to n. 4
1, 12, 60, 30, 2520, 2520, 360360, 180180, 60060, 60060, 232792560, 232792560, 26771144400, 26771144400, 26771144400, 13385572200, 144403552893600, 144403552893600, 5342931457063200, 5342931457063200, 5342931457063200 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

T. D. Noe, Table of n, a(n) for n = 1..200

FORMULA

a(n) = lcm(n+1, ..., n + A075365(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]]

CROSSREFS

Cf. A075365, A075366, A075368.

Sequence in context: A231340 A099321 A097302 * A012658 A012407 A009093

Adjacent sequences:  A075364 A075365 A075366 * A075368 A075369 A075370

KEYWORD

nice,nonn

AUTHOR

Amarnath Murthy, Sep 20 2002

EXTENSIONS

Edited by Dean Hickerson, Oct 28 2002

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 22 09:11 EDT 2021. Contains 348160 sequences. (Running on oeis4.)