The OEIS is supported by the many generous donors to the OEIS 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 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A072120 Least k such that n! divides C(2k,k). 0
 1, 1, 2, 7, 14, 15, 43, 191, 239, 383, 383, 1919, 1919, 3967, 4091, 65471, 65471, 129023, 129023, 516095, 516095, 917503, 1046527, 8323071, 8323071, 16760831, 16760831, 113246207, 113246207, 367001599, 367001599, 4294967291 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,3 LINKS Table of n, a(n) for n=1..32. MATHEMATICA a[n_] := Block[{k = 1}, While[ !IntegerQ[ Binomial[2k, k] / n! ], k++ ]; k]; Table[ a[n], {n, 1, 16}] PROG (PARI) for(n=1, 16, s=1; while(binomial(2*s, s)%n!>0, s++); print1(s, ", ")) CROSSREFS Sequence in context: A332542 A331703 A032537 * A247866 A057126 A363026 Adjacent sequences: A072117 A072118 A072119 * A072121 A072122 A072123 KEYWORD nonn AUTHOR Benoit Cloitre, Jun 19 2002 EXTENSIONS Edited and extended by Robert G. Wilson v, Jun 21 2002 More terms from Naohiro Nomoto, Jun 26 2002 More terms from Don Reble, Jul 01 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 9 04:27 EST 2023. Contains 367681 sequences. (Running on oeis4.)