This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A145459 Exponential transform of C(n,9) = A000582. 1
 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 10, 55, 220, 715, 2002, 5005, 11440, 24310, 72930, 1016158, 18643560, 258952330, 2845739820, 26177047270, 209411148144, 1495786618975, 9722602868550, 58373582056075, 329869586346300, 1861266055353705 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,11 COMMENTS a(n) is the number of ways of placing n labeled balls into indistinguishable boxes, where in each filled box 9 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 9 labels. LINKS N. J. A. Sloane, Transforms MAPLE a:= proc(n) option remember; local j; `if` (n=0, 1, add (binomial (n-1, j-1) *binomial(j, 9) *a(n-j), j=1..n)) end: seq (a(n), n=0..35); CROSSREFS Cf. 9th column of A145460, A143398. Sequence in context: A023035 A128936 A000582 * A034241 A022575 A202481 Adjacent sequences:  A145456 A145457 A145458 * A145460 A145461 A145462 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 | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified June 18 18:23 EDT 2013. Contains 226355 sequences.