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

%I #48 Jan 10 2022 05:26:25

%S 2,924,154836,227736432,84331608790,1138842118714300

%N Least number m > 1 such that the central binomial coefficient C(2m,m) is divisible by m^n.

%C 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

%C a(6) <= 4380346834858680. - _David A. Corneth_, Mar 04 2017

%C a(7) <= 2404760413443713325. - _Giovanni Resta_, Mar 16 2017

%H Wikipedia, <a href="https://en.wikipedia.org/wiki/Kummer&#39;s_theorem">Kummer's theorem</a>.

%t f[n_] := Block[{k = 2}, While[Mod[Binomial[2k, k], k^n] > 0, k++]; k]

%Y Cf. A000108, A000984, A014847, A121943, A282163, A283073, A283074, A282672.

%K nonn,hard,more

%O 1,1

%A _Lucian Craciun_ and _Robert G. Wilson v_, Feb 12 2017

%E a(4)-a(5) from _Giovanni Resta_, Feb 23 2017

%E a(6) from _Giovanni Resta_, Mar 15 2017

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 April 25 07:07 EDT 2024. Contains 371964 sequences. (Running on oeis4.)