

A244463


Number of unlabeled rooted trees with n nodes such that the minimal outdegree of inner nodes equals 9.


3



1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 2, 2, 2, 2, 2, 2, 2, 2, 4, 7, 12, 16, 21, 25, 30, 34, 39, 47, 61, 83, 117, 160, 215, 280, 356, 442, 549, 682, 864, 1112, 1458, 1919, 2533, 3313, 4298, 5521, 7057, 8995, 11497, 14751, 19042, 24687, 32102, 41731, 54172, 70112, 90535
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

10,11


LINKS



MAPLE

b:= proc(n, i, t, k) option remember; `if`(n=0, `if`(t in [0, k],
1, 0), `if`(i<1 or t>n, 0, add(binomial(b((i1)$2, k$2)+j1, j)*
b(ni*j, i1, max(0, tj), k), j=0..n/i)))
end:
a:= n> b(n1$2, 9$2) b(n1$2, 10$2):
seq(a(n), n=10..75);


CROSSREFS



KEYWORD

nonn


AUTHOR



STATUS

approved



