In combinatorial mathematics, the Catalan numbers are a sequence of natural numbers that occur in various counting problems, often involving recursively defined objects. They are named after the French-Belgian mathematician Eugène Charles Catalan.
The nth Catalan number can be expressed directly in terms of the central binomial coefficients by
The first Catalan numbers for n = 0, 1, 2, 3, ... are
1, 1, 2, 5, 14, 42, 132, 429, 1430, 4862, 16796, 58786, ... .
An alternative expression for Cn is
for
which is equivalent to the expression given above because . This expression shows that Cn is an integer, which is not immediately obvious from the first formula given. This expression forms the basis for a proof of the correctness of the formula.
Another alternative expression is
which can be directly interpreted in terms of the cycle lemma; see below.
The Catalan numbers satisfy the recurrence relations
and
Asymptotically, the Catalan numbers grow as
in the sense that the quotient of the nth Catalan number and the expression on the right tends towards 1 as n approaches infinity. A more accurate asymptotic analysis shows that the Catalan numbers are approximated by the fourth order approximation.
This can be proved by using the asymptotic growth of the central binomial coefficients, by Stirling's approximation for , or via generating functions.
The only Catalan numbers Cn that are odd are those for which n = 2k − 1; all others are even. The only prime Catalan numbers are C2 = 2 and C3 = 5.
The Catalan numbers have the integral representations
which immediately yields .
This has a simple probabilistic interpretation. Consider a random walk on the integer line, starting at 0. Let -1 be a "trap" state, such that if the walker arrives at -1, it will remain there. The walker can arrive at the trap state at times 1, 3, 5, 7..., and the number of ways the walker can arrive at the trap state at time is . Since the 1D random walk is recurrent, the probability that the walker eventually arrives at -1 is .