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

A273655
Number of forests of labeled rooted trees of height at most 1, with n labels, five of which are used for root nodes and any root may contain >= 1 labels.
2
52, 906, 9891, 87416, 686826, 5020092, 35006202, 236460312, 1562226237, 10158790642, 65294141913, 415967090448, 2631510433188, 16551428673528, 103578621308388, 645186720537744, 4000912828433199, 24700465510596414, 151810205132056779, 928768921758036744
OFFSET
5,1
LINKS
FORMULA
E.g.f.: x^5/5! * Sum_{j=0..5} Stirling2(5,j)*exp(x)^j.
a(n) = C(n,5) * Sum_{j=0..5} Stirling2(5,j) * j^(n-5).
MAPLE
a:= n-> binomial(n, 5)*add(Stirling2(5, j)*j^(n-5), j=0..5):
seq(a(n), n=5..40);
CROSSREFS
Column k=5 of A143396.
Sequence in context: A232312 A278001 A083936 * A160288 A133238 A331127
KEYWORD
nonn
AUTHOR
Alois P. Heinz, May 27 2016
STATUS
approved