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!)
A240682 Number of forests with n labeled nodes and 5 trees. 3
1, 15, 210, 3220, 55755, 1092105, 24048255, 590412240, 16027796070, 477411574640, 15495339234375, 544652100894720, 20619226977792170, 836670560604157440, 36232055577668433690, 1668081561600000000000, 81363801140161673297535, 4191692026268767965880320 (list; graph; refs; listen; history; text; internal format)
OFFSET
5,2
LINKS
FORMULA
a(n) = n^(n-10) * (n-4)*(n-3)*(n-2)*(n-1)*(n^4 + 30*n^3 + 451*n^2 + 3846*n + 15120)/384. - Vaclav Kotesovec, Sep 06 2014
MAPLE
T:= proc(n, m) option remember; `if`(n<0, 0, `if`(n=m, 1,
`if`(m<1 or m>n, 0, add(binomial(n-1, j-1)*j^(j-2)*
T(n-j, m-1), j=1..n-m+1))))
end:
a:= n-> T(n, 5):
seq(a(n), n=5..30);
MATHEMATICA
Table[n^(n-10) * (n-4)*(n-3)*(n-2)*(n-1)*(n^4 + 30*n^3 + 451*n^2 + 3846*n + 15120)/384, {n, 5, 20}] (* Vaclav Kotesovec, Sep 06 2014 *)
CROSSREFS
Column m=5 of A105599. A diagonal of A138464.
Sequence in context: A170734 A186231 A001880 * A113362 A252875 A135519
KEYWORD
nonn
AUTHOR
Alois P. Heinz, Apr 10 2014
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 March 19 03:33 EDT 2024. Contains 370952 sequences. (Running on oeis4.)