InequivalentIncreasingTreeCount on OrderedTree
The number of increasing labelings of the tree up to its automorphisms: n! over the tree factorial and the automorphism group size.
Called as CombinatorialStat(x, "InequivalentIncreasingTreeCount"). The head's page has its examples.
Live
Distribution
Over OrderedTrees at each size, tallied here in your browser; sizes past 6 are not offered.
FindStat St000416
The number of inequivalent increasing trees of an ordered tree.
| Object | Value |
|---|---|
[[]] | 1 |
[[[]]] | 1 |
[[],[]] | 1 |
[[[[]]]] | 1 |
[[[],[]]] | 1 |
[[[]],[]] | 3 |
[[],[[]]] | 3 |
[[[[[]]]]] | 1 |
Data from FindStat, the combinatorial statistic finder; the page at findstat.org/St000416 has the rest.