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

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 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A273657 Number of forests of labeled rooted trees of height at most 1, with n labels, seven of which are used for root nodes and any root may contain >= 1 labels. 2
 877, 26104, 463212, 6409320, 76595310, 832521096, 8480449692, 82506827832, 776400941745, 7128606776720, 64261876786536, 571350882111984, 5026991629995036, 43878686837771760, 380672326962043560, 3287071510635218064, 28280022744131688519, 242602886107926614952 (list; graph; refs; listen; history; text; internal format)
 OFFSET 7,1 LINKS Alois P. Heinz, Table of n, a(n) for n = 7..1000 FORMULA E.g.f.: x^7/7! * Sum_{j=0..7} Stirling2(7,j)*exp(x)^j. a(n) = C(n,7) * Sum_{j=0..7} Stirling2(7,j) * j^(n-7). MAPLE a:= n-> binomial(n, 7)*add(Stirling2(7, j)*j^(n-7), j=0..7): seq(a(n), n=7..40); CROSSREFS Column k=7 of A143396. Sequence in context: A294057 A255947 A048791 * A188391 A209464 A209526 Adjacent sequences:  A273654 A273655 A273656 * A273658 A273659 A273660 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 December 5 22:34 EST 2021. Contains 349558 sequences. (Running on oeis4.)