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

A244464
Number of unlabeled rooted trees with n nodes such that the minimal outdegree of inner nodes equals 10.
3
1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 4, 7, 12, 16, 21, 25, 30, 34, 39, 43, 52, 65, 88, 121, 165, 219, 285, 360, 447, 544, 661, 805, 998, 1256, 1613, 2085, 2709, 3500, 4496, 5709, 7201, 9016, 11277, 14108, 17738, 22410, 28484, 36330
OFFSET
11,12
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((i-1)$2, k$2)+j-1, j)*
b(n-i*j, i-1, max(0, t-j), k), j=0..n/i)))
end:
a:= n-> b(n-1$2, 10$2) -b(n-1$2, 11$2):
seq(a(n), n=11..80);
CROSSREFS
Column k=10 of A244454.
Cf. A244539.
Sequence in context: A032574 A058515 A126696 * A250201 A252375 A339170
KEYWORD
nonn
AUTHOR
Joerg Arndt and Alois P. Heinz, Jun 29 2014
STATUS
approved