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

A318818
Number of rooted trees with n nodes such that three equals the maximal number of subtrees of the same size extending from the same node.
2
0, 1, 1, 3, 9, 23, 60, 166, 447, 1219, 3344, 9214, 25493, 70853, 197150, 550259, 1539767, 4314746, 12112304, 34063256, 95904943, 270375031, 763193304, 2156328194, 6098563949, 17264760959, 48912296290, 138683094562, 393514686620, 1117304554815, 3174397805762
OFFSET
3,4
LINKS
MAPLE
g:= proc(n, i, k) option remember; `if`(n=0, 1, `if`(i<1, 0, add(
binomial(g(i-1$2, k)+j-1, j)*g(n-i*j, i-1, k), j=0..min(k, n/i))))
end:
a:= n-> (k-> g(n-1$2, k) -g(n-1$2, k-1))(3):
seq(a(n), n=3..33);
CROSSREFS
Column k=3 of A318754.
Sequence in context: A323798 A180488 A318860 * A026599 A061647 A207008
KEYWORD
nonn
AUTHOR
Alois P. Heinz, Sep 04 2018
STATUS
approved