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

A273660
Number of forests of labeled rooted trees of height at most 1, with n labels, ten of which are used for root nodes and any root may contain >= 1 labels.
2
115975, 6188545, 188526162, 4324211606, 83234980829, 1422697691415, 22336690031656, 329296289467288, 4628083121855622, 62687799439000450, 824939949711312292, 10611095747493196956, 134039591449028959694, 1668916223557034160170, 20541239452587941670792
OFFSET
10,1
LINKS
FORMULA
E.g.f.: x^10/10! * Sum_{j=0..10} Stirling2(10,j)*exp(x)^j.
a(n) = C(n,10) * Sum_{j=0..10} Stirling2(10,j) * j^(n-10).
MAPLE
a:= n-> binomial(n, 10)*add(Stirling2(10, j)*j^(n-10), j=0..10):
seq(a(n), n=10..40);
CROSSREFS
Column k=10 of A143396.
Sequence in context: A346830 A346863 A255950 * A254565 A237479 A154065
KEYWORD
nonn
AUTHOR
Alois P. Heinz, May 27 2016
STATUS
approved