login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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 (list; graph; refs; listen; history; text; internal format)
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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 9 03:06 EDT 2024. Contains 375759 sequences. (Running on oeis4.)