login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A145457 Exponential transform of C(n,7) = A000580. 1
1, 0, 0, 0, 0, 0, 0, 1, 8, 36, 120, 330, 792, 1716, 5148, 57915, 835120, 9354488, 84047184, 638567124, 4256855760, 25607297880, 144863655024, 869425029957, 7081044528888, 83816629147900, 1131047706331400, 14634713798592030 (list; graph; refs; listen; history; internal format)
OFFSET

0,9

COMMENTS

a(n) is the number of ways of placing n labeled balls into indistinguishable boxes, where in each filled box 7 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 7 labels.

LINKS

N. J. A. Sloane, Transforms

Index entries for sequences related to rooted trees

MAPLE

a:= proc(n) option remember; local j; `if` (n=0, 1, add (binomial (n-1, j-1) *binomial(j, 7) *a(n-j), j=1..n)) end: seq (a(n), n=0..30);

CROSSREFS

Cf. 7th column of A145460, A143398.

Sequence in context: A008490 A023033 A000580 * A145136 A144901 A054470

Adjacent sequences:  A145454 A145455 A145456 * A145458 A145459 A145460

KEYWORD

nonn

AUTHOR

Alois P. Heinz (heinz(AT)hs-heilbronn.de), Oct 10 2008

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 February 16 08:13 EST 2012. Contains 205893 sequences.