The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons 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 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A025540 Least common multiple of {C(0,0), C(2,1), ..., C(2n,n)}. 1
 1, 2, 6, 60, 420, 1260, 13860, 360360, 360360, 6126120, 116396280, 116396280, 2677114440, 13385572200, 40156716600, 2329089562800, 72201776446800, 72201776446800, 72201776446800, 2671465728531600, 2671465728531600 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 LINKS Vincenzo Librandi, Table of n, a(n) for n = 0..1000 Mathoverflow, Asymptotic of LCM(binomial(2k,k)), 1<=k<=n FORMULA a(n) = 2^floor(log(n+1)/log(2)) * Prod( p^floor(log(2n)/log(p)) ), where the product is taken over all odd primes p below 2n. -  Max Alekseyev, Apr 13 2016 If n = 2^k - 1, then a(n) = A099996(n) = A003418(2*n); otherwise a(n) = A099996(n)/2 = A003418(2*n)/2. - Max Alekseyev, Apr 13 2016 MATHEMATICA Table[LCM@@Table[Binomial[2n, n], {n, 0, i}], {i, 0, 30}] (* Harvey P. Dale, Jun 04 2012 *) PROG (PARI) a(n) = lcm(vector(n, k, binomial(2*k, k))); \\ Michel Marcus, Apr 13 2016 CROSSREFS Cf. A000984. Sequence in context: A138286 A308532 A102290 * A334224 A226959 A083135 Adjacent sequences:  A025537 A025538 A025539 * A025541 A025542 A025543 KEYWORD nonn AUTHOR 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.

Last modified December 8 20:11 EST 2021. Contains 349596 sequences. (Running on oeis4.)