

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



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



KEYWORD

nonn


AUTHOR



EXTENSIONS



STATUS

approved



