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!)
A273660 Number of forests of labeled rooted trees of height at most 1, with n labels, ten of which are used for root nodes and any root may contain >= 1 labels. 2
115975, 6188545, 188526162, 4324211606, 83234980829, 1422697691415, 22336690031656, 329296289467288, 4628083121855622, 62687799439000450, 824939949711312292, 10611095747493196956, 134039591449028959694, 1668916223557034160170, 20541239452587941670792 (list; graph; refs; listen; history; text; internal format)
OFFSET
10,1
LINKS
FORMULA
E.g.f.: x^10/10! * Sum_{j=0..10} Stirling2(10,j)*exp(x)^j.
a(n) = C(n,10) * Sum_{j=0..10} Stirling2(10,j) * j^(n-10).
MAPLE
a:= n-> binomial(n, 10)*add(Stirling2(10, j)*j^(n-10), j=0..10):
seq(a(n), n=10..40);
CROSSREFS
Column k=10 of A143396.
Sequence in context: A346830 A346863 A255950 * A254565 A237479 A154065
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 18 21:51 EDT 2024. Contains 371781 sequences. (Running on oeis4.)