|
|
A283073
|
|
Numbers k such that the central binomial coefficient C(2*k,k) is divisible by k^4.
|
|
7
|
|
|
1, 227736432, 338956200, 386160984, 482213160, 544508118, 548823405, 715592220, 726922482, 731987190, 1427877360, 1448431600, 1467104760, 1490842353, 1491241258, 1504640335, 1646570115, 1852712100, 1923506200, 1923927460, 1924947570, 2056580995, 2064409413
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
Equivalently, numbers k such that the k-th Catalan number C(2*k,k)/(k+1) is divisible by k^4.
The asymptotic density of this sequence is 1.330129946... * 10^(-7) (Ford and Konyagin, 2021). - Amiram Eldar, Jan 26 2021
|
|
LINKS
|
|
|
EXAMPLE
|
The central binomial coefficient C(2*227736432,227736432) is divisible by 227736432^4.
|
|
MATHEMATICA
|
A283073:={}; k:=4; For[n:=1, n<=10^9, n++, {f=FactorInteger[n], For[j:=1, j<=Length[f], j++, {b=True, If[Sum[Floor[2n/f[[j, 1]]^i]-2 Floor[n/f[[j, 1]]^i], {i, 1, Length[IntegerDigits[2n, f[[j, 1]]]]}]<f[[j, 2]]k, {b=False, Break[]}]}], If[b, A283073=Append[A283073, n]]}] (* Legendre's formula for drastic time reduction *)
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|