How do you count rooted planar n -ary trees with some number of leaves? For n = 2 this puzzle leads to the Catalan numbers. These are so fascinating that the combinatorist Richard Stanley wrote a ...

Note: These pages make extensive use of the latest XHTML and CSS Standards. They ought to look great in any standards-compliant modern browser. Unfortunately, they will probably look horrible in older ...