login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A282346 Least number m > 1 such that the central binomial coefficient C(2m,m) is divisible by m^n. 6
2, 924, 154836, 227736432, 84331608790, 1138842118714300 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
Equivalently, least number m > 1 such that the m-th Catalan number C(2m,m)/(m+1) is divisible by m^n. - Lucian Craciun, Mar 01 2017
a(6) <= 4380346834858680. - David A. Corneth, Mar 04 2017
a(7) <= 2404760413443713325. - Giovanni Resta, Mar 16 2017
LINKS
Wikipedia, Kummer's theorem.
MATHEMATICA
f[n_] := Block[{k = 2}, While[Mod[Binomial[2k, k], k^n] > 0, k++]; k]
CROSSREFS
Sequence in context: A265617 A324597 A159723 * A070967 A070927 A070922
KEYWORD
nonn,hard,more
AUTHOR
EXTENSIONS
a(4)-a(5) from Giovanni Resta, Feb 23 2017
a(6) from Giovanni Resta, Mar 15 2017
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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 11 07:10 EDT 2024. Contains 372388 sequences. (Running on oeis4.)