Catalan-like numbers and determinants (Q1296752)

The Catalan numbers play a central role in enumerations. They can be defined by recursion but also via so-called Hankel matrices. The Motzkin numbers are defined by a very similar recursion, and Aigner also found a description using Hankel matrices. Both types of numbers are involved in several classical formulae with binomial coefficients (and with each other). This paper introduces the so-called Catalan-like numbers which share these common features. The Catalan and Motzkin numbers are special cases of the Catalan-like numbers. General recursions, binomial identities and a generating function are determined. Catalan-like numbers can be applied in enumerating paths or rooted trees, for example.