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

A273654
Number of forests of labeled rooted trees of height at most 1, with n labels, four of which are used for root nodes and any root may contain >= 1 labels.
2
15, 185, 1485, 9905, 59850, 341082, 1872990, 10032990, 52814025, 274436305, 1411449039, 7195628895, 36390053700, 182622509860, 909578754540, 4496410556268, 22062707386875, 107464431586995, 519700280676885, 2495827315731365, 11905791978208590, 56429414876395550
OFFSET
4,1
LINKS
FORMULA
E.g.f.: x^4/4! * Sum_{j=0..4} Stirling2(4,j)*exp(x)^j.
a(n) = C(n,4) * Sum_{j=0..4} Stirling2(4,j) * j^(n-4).
MAPLE
a:= n-> binomial(n, 4)*add(Stirling2(4, j)*j^(n-4), j=0..4):
seq(a(n), n=4..40);
CROSSREFS
Column k=4 of A143396.
Sequence in context: A125450 A193709 A157689 * A079516 A206521 A366662
KEYWORD
nonn
AUTHOR
Alois P. Heinz, May 27 2016
STATUS
approved