|
Search: id:A075366
|
|
|
| A075366 |
|
Smallest product (n+1)(n+2)...(n+k) that is divisible by the product of all the primes up to n. |
|
+0
4
|
|
| 1, 12, 120, 30, 30240, 5040, 17297280, 2162160, 240240, 360360, 28158588057600, 2346549004800, 64764752532480000, 4626053752320000, 308403583488000, 19275223968000, 830034394580628357120000, 46113021921146019840000
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
FORMULA
|
If p <= n < q, where p and q are consecutive primes, then a(n) = (2p)!/n!, unless n=10.
|
|
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[n_] := Times@@Range[n+1, n+a75365[n]]
|
|
CROSSREFS
|
Cf. A075365, A075367, A075368.
Sequence in context: A077251 A075622 A153054 this_sequence A076633 A110423 A006953
Adjacent sequences: A075363 A075364 A075365 this_sequence A075367 A075368 A075369
|
|
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
|
