The central binomial coefficients satisfy the recurrence
Since we find
Together with the binomial series we obtain the generating function
and exponential generating function
where I0 is a modified Bessel function of the first kind.
The Wallis product can be written in asymptotic form for the central binomial coefficient:
The latter can also be easily established by means of Stirling's formula. On the other hand, it can also be used as a means to determine the constant in front of the Stirling formula, by comparison.
Simple bounds that immediately follow from are
Some better bounds are
and, if more accuracy is required,
- for all
The only central binomial coefficient that is odd is 1. More specifically, the number of factors of 2 in is equal to the number of ones in the binary representation of n.
By the Erdős squarefree conjecture, proven in 1996, no central binomial coefficient with n > 4 is squarefree.
The central binomial coefficient equals the sum of the squares of the elements in row n of Pascal's triangle.
The closely related Catalan numbers Cn are given by:
A slight generalization of central binomial coefficients is to take them as
, with appropriate real numbers n, where is the gamma function and is the beta function.
The powers of two that divide the central binomial coefficients are given by Gould's sequence, whose nth element is the number of odd integers in row n of Pascal's triangle.