OFFSET
1,2
COMMENTS
We define the n-th standard ordered rooted tree to be obtained by taking the (n-1)-th composition in standard order (graded reverse-lexicographic, A066099) as root and replacing each part with its own standard ordered rooted tree. This ranking is an ordered variation of Matula-Goebel numbers, giving a bijective correspondence between positive integers and unlabeled ordered rooted trees.
A rooted identity tree is an unlabeled rooted tree with no repeated branches directly under the same root.
LINKS
EXAMPLE
The terms together with their corresponding ordered rooted trees begin:
1: o
2: (o)
3: ((o))
5: (((o)))
6: ((o)o)
7: (o(o))
10: (((o))o)
13: (o((o)))
17: ((((o))))
19: (((o))(o))
21: ((o)((o)))
33: (((o)o))
34: ((((o)))o)
38: (((o))(o)o)
39: (((o))o(o))
42: ((o)((o))o)
45: ((o)o((o)))
MATHEMATICA
stc[n_]:=Differences[Prepend[Join@@Position[Reverse[IntegerDigits[n, 2]], 1], 0]]//Reverse;
srt[n_]:=If[n==1, {}, srt/@stc[n-1]];
Select[Range[100], FreeQ[srt[#], _[__]?(!UnsameQ@@#&)]&]
CROSSREFS
These trees are counted by A032027.
KEYWORD
nonn
AUTHOR
Gus Wiseman, Nov 14 2022
STATUS
approved