OFFSET
1,4
COMMENTS
A rooted tree with thinning limbs is such that if a node has k children, all its children have at most k children.
LINKS
Alois P. Heinz, Table of n, a(n) for n = 1..140
EXAMPLE
The a(7) = 6 trees are ((((((o)))))), (o((((o))))), (o(o((o)))), ((o)(((o)))), ((o)(o(o))), (o(o)((o))). - Gus Wiseman, Jan 25 2018
MATHEMATICA
idthinQ[t_]:=And@@Cases[t, b_List:>UnsameQ@@b&&Length[b]>=Max@@Length/@b, {0, Infinity}];
itrut[n_]:=itrut[n]=If[n===1, {{}}, Select[Join@@Function[c, Union[Sort/@Tuples[itrut/@c]]]/@IntegerPartitions[n-1], idthinQ]];
Table[Length[itrut[n]], {n, 25}] (* Gus Wiseman, Jan 25 2018 *)
CROSSREFS
KEYWORD
nonn
AUTHOR
Christian G. Bower, Oct 30 2006, suggested by Franklin T. Adams-Watters
STATUS
approved