In combinatorial mathematics, the Lobb number Lm,n counts the ways that n + m open parentheses and n − m close parentheses can be arranged to form the start of a valid sequence of balanced parentheses.[1]
Lobb numbers form a natural generalization of the Catalan numbers, which count the complete strings of balanced parentheses of a given length. Thus, the nth Catalan number equals the Lobb number L0,n.[2] They are named after Andrew Lobb, who used them to give a simple inductive proof of the formula for the nth Catalan number.[3]
The Lobb numbers are parameterized by two non-negative integers m and n with n ≥ m ≥ 0. The (m, n)th Lobb number Lm,n is given in terms of binomial coefficients by the formula
Lm,n=
| 2m+1 | |
| m+n+1 |
\binom{2n}{m+n} forn\gem\ge0.
An alternative expression for Lobb number Lm,n is:
Lm,n=\binom{2n}{m+n}-\binom{2n}{m+n+1}.
The triangle of these numbers starts as
\begin{array}{rrrrrr} 1\\ 1&1\\ 2&3&1\\ 5&9&5&1\\ 14&28&20&7&1\\ 42&90&75&35&9&1\\ \end{array}
Ln,n=1,
L0,n=
| 1 | |
| 1+n |
\binom{2n}{n}.
As well as counting sequences of parentheses, the Lobb numbers also count the ways in which n + m copies of the value +1 and n − m copies of the value −1 may be arranged into a sequence such that all of the partial sums of the sequence are non-negative.
The combinatorics of parentheses is replaced with counting ballots in an election with two candidates in Bertrand's ballot theorem, first published by William Allen Whitworth in 1878. The theorem states the probability that winning candidate is ahead in the count, given known final tallies for each candidate.