|
%I #11 Mar 27 2016 20:44:41
%S 1,15,42,153,153,209,943,1989,3318,11725,14322,30191,96113,96113,
%T 131054,458671,1040366,1540061
%N Least k such that k(k+1)(k+2)...(k+n) divides C(2k,k).
%t g[n_] := Block[{k = 1}, While[ !IntegerQ[ Binomial[2k, k] / Product[i, {i, k, k + n}]], k++ ]; Return[k]]; Table[ a[n], {n, 1, 13}]
%o (PARI) for(n=1,8,s=1; while(binomial(2*s,s)%prod(i=0,n,(s+i))>0,s++); print1(s,","))
%K nonn
%O 1,2
%A _Benoit Cloitre_, Jun 19 2002
%E More terms from _Naohiro Nomoto_ and _Robert G. Wilson v_, Jun 21 2002
%E a(14)-a(18) from _Chai Wah Wu_, Mar 27 2016
|
