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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A273659 Number of forests of labeled rooted trees of height at most 1, with n labels, nine of which are used for root nodes and any root may contain >= 1 labels. 2
 21147, 948280, 24564100, 483787480, 8061693640, 120120836836, 1653807555400, 21489660580960, 267385444371760, 3218688299529560, 37768351403903120, 434451231603262640, 4920317819371507280, 55047363589643246360, 609969295304994614000, 6708182596868603027936 (list; graph; refs; listen; history; text; internal format)
 OFFSET 9,1 LINKS Alois P. Heinz, Table of n, a(n) for n = 9..1000 FORMULA E.g.f.: x^9/9! * Sum_{j=0..9} Stirling2(9,j)*exp(x)^j. a(n) = C(n,9) * Sum_{j=0..9} Stirling2(9,j) * j^(n-9). MAPLE a:= n-> binomial(n, 9)*add(Stirling2(9, j)*j^(n-9), j=0..9): seq(a(n), n=9..40); CROSSREFS Column k=9 of A143396. Sequence in context: A320560 A294059 A255949 * A109029 A284915 A252165 Adjacent sequences: A273656 A273657 A273658 * A273660 A273661 A273662 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.

Last modified May 31 23:09 EDT 2023. Contains 363068 sequences. (Running on oeis4.)