|
Search: id:A075367
|
|
|
| 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. |
|
+0
4
|
|
| 1, 12, 60, 30, 2520, 2520, 360360, 180180, 60060, 60060, 232792560, 232792560, 26771144400, 26771144400, 26771144400, 13385572200, 144403552893600, 144403552893600, 5342931457063200, 5342931457063200, 5342931457063200
(list; graph; listen)
|
|
|
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: A048362 A099321 A097302 this_sequence A012658 A012407 A009093
Adjacent sequences: A075364 A075365 A075366 this_sequence A075368 A075369 A075370
|
|
KEYWORD
|
nice,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
|
|
|
Search completed in 0.002 seconds
|
