A076733 - OEIS

A076733

Largest k such that k! divides C(2n,n).

2, 3, 2, 2, 3, 3, 4, 3, 2, 2, 4, 2, 2, 5, 6, 3, 3, 3, 5, 3, 5, 5, 6, 3, 4, 4, 2, 2, 5, 2, 2, 3, 3, 3, 4, 2, 2, 5, 2, 2, 5, 5, 7, 5, 7, 7, 7, 3, 5, 4, 4, 4, 7, 5, 4, 4, 4, 5, 6, 4, 4, 4, 5, 3, 3, 3, 5, 3, 5, 5, 6, 3, 5, 5, 7, 5, 7, 7, 7, 3, 2, 2, 5, 2, 2, 7, 5, 5, 7, 2, 2, 5, 2, 2, 7, 3, 5, 5, 5, 5, 6, 5, 5, 5, 6

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,1

COMMENTS

All a(n) >= 2, with a(n) = 2 if and only if n is in A005836. - Robert Israel, Feb 01 2019

LINKS

Robert Israel, Table of n, a(n) for n = 1..10000

MAPLE

f:= proc(n) local x, k;

x:= binomial(2*n, n);

for k from 2 do if not (x/k!)::integer then return k-1 fi od

end proc: