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!)
A145456 Exponential transform of C(n,6) = A000579. 3
1, 0, 0, 0, 0, 0, 1, 7, 28, 84, 210, 462, 1386, 13728, 171171, 1686685, 13461448, 91495768, 551777772, 3142726692, 19787406360, 172188951144, 1999835600301, 24655331721867, 285725747201356, 3034790658153100, 29876851476502030 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,8
COMMENTS
a(n) is the number of ways of placing n labeled balls into indistinguishable boxes, where in each filled box 6 balls are seen at the top.
a(n) is also the number of forests of labeled rooted trees of height at most 1, with n labels, where each root contains 6 labels.
LINKS
N. J. A. Sloane, Transforms
FORMULA
E.g.f.: exp(exp(x)*x^6/6!).
MAPLE
a:= proc(n) option remember; `if`(n=0, 1,
add(binomial(n-1, j-1) *binomial(j, 6) *a(n-j), j=1..n))
end:
seq(a(n), n=0..30);
MATHEMATICA
With[{nn=30}, CoefficientList[Series[Exp[Exp[x] x^6/6!], {x, 0, nn}], x] Range[0, nn]!] (* Harvey P. Dale, Apr 14 2018 *)
CROSSREFS
6th column of A145460, A143398.
Sequence in context: A229887 A243741 A369809 * A369808 A145135 A369807
KEYWORD
nonn
AUTHOR
Alois P. Heinz, Oct 10 2008
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 July 19 12:22 EDT 2024. Contains 374394 sequences. (Running on oeis4.)