Number of labeled nodes in generation n of a rooted tree where a node with label k has k child nodes with distinct labels, such that each child node is assigned the least unused label in the path that leads back to the root node with label '1'.
A125033
Number of labeled nodes in generation n of a rooted tree where a node with label k has k child nodes with distinct labels, such that each child node is assigned the least unused label in the path that leads back to the root node with label '1'.
Terms
- a(0) =1a(1) =1a(2) =2a(3) =7a(4) =36a(5) =248a(6) =2157a(7) =22761a(8) =283220a(9) =4068411a(10) =66367834a(11) =1213504295a(12) =24606397802
External references
- oeis: A125033