The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A273652 Number of forests of labeled rooted trees of height at most 1, with n labels, two of which are used for root nodes and any root may contain >= 1 labels. 2
 2, 9, 30, 90, 255, 693, 1820, 4644, 11565, 28215, 67650, 159822, 372827, 860265, 1966200, 4456584, 10027161, 22413483, 49807550, 110100690, 242221287, 530579709, 1157628180, 2516582700, 5452595525, 11777605983, 25367150970, 54492397974, 116769423795 (list; graph; refs; listen; history; text; internal format)
 OFFSET 2,1 LINKS Alois P. Heinz, Table of n, a(n) for n = 2..1000 FORMULA E.g.f.: x^2/2! * Sum_{j=0..2} Stirling2(2,j)*exp(x)^j. a(n) = C(n,2) * Sum_{j=0..2} Stirling2(2,j) * j^(n-2). MAPLE a:= n-> binomial(n, 2)*add(Stirling2(2, j)*j^(n-2), j=0..2): seq(a(n), n=2..40); CROSSREFS Column k=2 of A143396. Sequence in context: A268586 A056288 A261174 * A056283 A192518 A277241 Adjacent sequences:  A273649 A273650 A273651 * A273653 A273654 A273655 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified August 6 19:52 EDT 2020. Contains 336256 sequences. (Running on oeis4.)