This is documentation for Mathematica 6, which was
based on an earlier version of the Wolfram Language.
View current documentation (Version 11.1)


gives the number of ways of labeling the vertices of tree with a totally ordered set of labels such that if (m, n) is an edge, then m<n.