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

A245753
Number of identity trees with n nodes where the maximal outdegree (branching factor) equals 8.
2
1, 19, 113, 564, 2362, 9062, 32336, 109826, 358021, 1131089, 3480858, 10484995, 31012892, 90329292, 259621691, 737665484, 2074944123, 5785110380, 16003477783, 43963346701, 120021805899, 325835717520, 880125679307, 2366498068034, 6336725620724, 16903670460151
OFFSET
30,2
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, 8$2) -b(n-1$2, 7$2):
seq(a(n), n=30..60);
CROSSREFS
Column k=8 of A244523.
Sequence in context: A186105 A080442 A033655 * A164604 A142370 A084751
KEYWORD
nonn
AUTHOR
Joerg Arndt and Alois P. Heinz, Jul 31 2014
STATUS
approved