In mathematics the nth central binomial coefficient is the particular binomial coefficient They are called central since they show up exactly in the middle of the even-numbered rows in Pascal's triangle. The first few central binomial coefficients starting at n = 0 are: , , , , , 924, 3432, 12870, 48620, ...; The central binomial coefficient is the number of arrangements where there are an equal number of two types of objects. For example, when , the binomial coefficient is equal to 6, and there are six arrangements of two copies of A and two copies of B: AABB, ABAB, ABBA, BAAB, BABA, BBAA. The same central binomial coefficient is also the number of words of length 2n made up of A and B where there are never more B than A at any point as one reads from left to right. For example, when , there are six words of length 4 in which each prefix has at least as many copies of A as of B: AAAA, AAAB, AABA, AABB, ABAA, ABAB. The number of factors of 2 in is equal to the number of 1s in the binary representation of n. As a consequence, 1 is the only odd central binomial coefficient. The ordinary generating function for the central binomial coefficients is This can be proved using the binomial series and the relation where is a generalized binomial coefficient. The central binomial coefficients have exponential generating function where I0 is a modified Bessel function of the first kind. The generating function of the squares of the central binomial coefficients can be written in terms of the complete elliptic integral of the first kind: Simple bounds that immediately follow from are The asymptotic behavior can be described more precisely: 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.

About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.