OFFSET
1,6
COMMENTS
Let T be an unlabeled rooted tree, and let L_k(T) be the number of vertices at graph distance k from root (so L_0(T) = 1). This sequence counts those T on n vertices whose level profile is strictly increasing L_0(T) < L_1(T) < ... < L_h(T), where h is the height of T.
LINKS
Robert P. P. McKone, Image of a(6) = 3 unlabeled rooted trees.
Robert P. P. McKone, Image of a(7) = 4 unlabeled rooted trees.
Robert P. P. McKone, Image of a(8) = 8 unlabeled rooted trees.
Robert P. P. McKone, Image of a(9) = 10 unlabeled rooted trees.
Robert P. P. McKone, Image of a(10) = 31 unlabeled rooted trees.
Robert P. P. McKone, Image of a(11) = 40 unlabeled rooted trees.
Robert P. P. McKone, Python program to calculate a(n).
Robert P. P. McKone, The unlabeled rooted trees with n=1 to n=19 nodes.
EXAMPLE
For a(5) = 1, the tree (oooo) has level sizes (1,4), which is strictly increasing.
For a(10) = 31, the trees are (((o)(o)(oo))o), (((o)(o))((oo))), (((o)(oo))((o))), (((o)(ooo))(o)), (((o)(ooo)o)o), (((o))((ooo)o)), (((o)o)((ooo))), (((oo)(oo))(o)), (((oo)(oo)o)o), (((oo))((oo)o)), (((oooo))(oo)), (((oooo)o)(o)), (((oooo)oo)o), ((o)(o)(o)(oo)), ((o)(o)(ooo)o), ((o)(o)(oooo)), ((o)(oo)(oo)o), ((o)(oo)(ooo)), ((o)(oooo)oo), ((o)(ooooo)o), ((o)(oooooo)), ((oo)(oo)(oo)), ((oo)(ooo)oo), ((oo)(oooo)o), ((oo)(ooooo)), ((ooo)(ooo)o), ((ooo)(oooo)), ((ooooo)ooo), ((oooooo)oo), ((ooooooo)o), (ooooooooo).
CROSSREFS
KEYWORD
nonn
AUTHOR
Robert P. P. McKone, Feb 11 2026
STATUS
approved
