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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A273658 Number of forests of labeled rooted trees of height at most 1, with n labels, eight of which are used for root nodes and any root may contain >= 1 labels. 2
4140, 153063, 3315645, 55239525, 786082275, 10081916559, 120278261103, 1361959159275, 14838761544750, 157056039953670, 1626124163724918, 16555067600440590, 166368479811851850, 1655233308679110930, 16341232769733507570, 160366537782578273850 (list; graph; refs; listen; history; text; internal format)
OFFSET

8,1

LINKS

Alois P. Heinz, Table of n, a(n) for n = 8..1000

FORMULA

E.g.f.: x^8/8! * Sum_{j=0..8} Stirling2(8,j)*exp(x)^j.

a(n) = C(n,8) * Sum_{j=0..8} Stirling2(8,j) * j^(n-8).

MAPLE

a:= n-> binomial(n, 8)*add(Stirling2(8, j)*j^(n-8), j=0..8):

seq(a(n), n=8..40);

CROSSREFS

Column k=8 of A143396.

Sequence in context: A320559 A294058 A255948 * A107541 A254230 A106537

Adjacent sequences:  A273655 A273656 A273657 * A273659 A273660 A273661

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 15 21:38 EDT 2021. Contains 348034 sequences. (Running on oeis4.)