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

A245755
Number of identity trees with n nodes where the maximal outdegree (branching factor) equals 10.
2
15, 147, 1003, 5286, 24396, 101768, 395410, 1452251, 5104104, 17300428, 56912396, 182543809, 573014123, 1765525901, 5352351017, 15996845972, 47213204699, 137795770991, 398168121417, 1140238386377, 3238947787201, 9133172049405, 25582174762816, 71220487524663
OFFSET
42,1
LINKS
MAPLE
b:= proc(n, i, t, k) option remember; `if`(n=0, 1,
`if`(i<1, 0, add(binomial(b(i-1$2, k$2), j)*
b(n-i*j, i-1, t-j, k), j=0..min(t, n/i))))
end:
a:= n-> b(n-1$2, 10$2) -b(n-1$2, 9$2):
seq(a(n), n=42..70);
CROSSREFS
Column k=10 of A244523.
Sequence in context: A025440 A155638 A252982 * A240419 A069417 A051272
KEYWORD
nonn
AUTHOR
Joerg Arndt and Alois P. Heinz, Jul 31 2014
STATUS
approved