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”).

A319381
Number of plane trees with n nodes where the sequence of branches directly under any given node is a membership-chain.
4
1, 1, 1, 2, 2, 4, 6, 9, 11, 20, 28, 40, 58, 82, 110, 159, 217, 305, 420, 570, 767, 1042
OFFSET
1,4
EXAMPLE
The a(9) = 11 membership-chain trees:
((((((((o)))))))) (((((((o)o)))))) ((((((o)o)o)))) (((((o)o)o)o))
((((((o))(o))))) (((((o)o)(o)))) ((((o)o)(o)o))
(((((o)))((o)))) (((((o))(o)o))) ((((o))(o)o)o)
((((o))(o))(o))
MATHEMATICA
yanplane[n_]:=If[n==1, {{}}, Join@@Table[Select[Tuples[yanplane/@c], And@@MemberQ@@@Partition[#, 2, 1]&], {c, Join@@Permutations/@IntegerPartitions[n-1]}]];
Table[Length[yanplane[n]], {n, 10}]
KEYWORD
nonn,more
AUTHOR
Gus Wiseman, Sep 17 2018
STATUS
approved