|
Search: id:A125033
|
|
|
| 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'. |
|
+0
1
|
|
| 1, 1, 2, 7, 36, 248, 2157, 22761, 283220, 4068411, 66367834, 1213504295, 24606397802
(list; graph; listen)
|
|
|
Search completed in 0.002 seconds
|
