login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A124346
Number of rooted identity trees on n nodes with thinning limbs.
5
1, 1, 1, 2, 2, 4, 6, 11, 17, 32, 56, 102, 184, 340, 624, 1161, 2156, 4036, 7562, 14234, 26828, 50747, 96125, 182545, 347187, 661618, 1262583, 2413275, 4618571, 8850905, 16981142, 32616900, 62713951, 120703497, 232527392, 448344798, 865182999, 1670884073
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
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 *)
KEYWORD
nonn
AUTHOR
STATUS
approved