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!)
A273655 Number of forests of labeled rooted trees of height at most 1, with n labels, five of which are used for root nodes and any root may contain >= 1 labels. 2
52, 906, 9891, 87416, 686826, 5020092, 35006202, 236460312, 1562226237, 10158790642, 65294141913, 415967090448, 2631510433188, 16551428673528, 103578621308388, 645186720537744, 4000912828433199, 24700465510596414, 151810205132056779, 928768921758036744 (list; graph; refs; listen; history; text; internal format)
OFFSET
5,1
LINKS
FORMULA
E.g.f.: x^5/5! * Sum_{j=0..5} Stirling2(5,j)*exp(x)^j.
a(n) = C(n,5) * Sum_{j=0..5} Stirling2(5,j) * j^(n-5).
MAPLE
a:= n-> binomial(n, 5)*add(Stirling2(5, j)*j^(n-5), j=0..5):
seq(a(n), n=5..40);
CROSSREFS
Column k=5 of A143396.
Sequence in context: A232312 A278001 A083936 * A160288 A133238 A331127
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 April 23 07:57 EDT 2024. Contains 371905 sequences. (Running on oeis4.)