Trees with Labeled Nodes that form Permutation of Positive Integers

[franktaw at netscape.net]

You need to reword that a bit.  Your example makes clear that the
children of a given node must all have distinct labels, but you don't
say so.

Without that condition, the problem is pretty easy.  :-)

Franklin T. Adams-Watters


-----Original Message-----
From: pauldhanna at juno.com

...

Number of labelled nodes in generation n of a rooted tree
where a node with label k has k child nodes such that
the label of each child node is the least unused label in
the path from the root to that child node,
and where root is labeled '1'.

...
________________________________________________________________________
Check Out the new free AIM(R) Mail -- 2 GB of storage and 
industry-leading spam and email virus protection.