Enumeration via ballot numbers

Several interesting combinatorial coefficients such as the Catalan numbers and the Bell numbers can be described either via a 3-term recurrence or as sums of (weighted) ballot numbers. This paper gives some general results connecting 3-term recurrences with ballot sequences with several applications to the enumeration of various combinatorial instances.