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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A133118 Number of partitions of n-set with 3 block sizes. 0
60, 315, 2268, 14742, 72180, 464640, 2676366, 16400098, 94209206, 673282610, 4095231104, 29371828846, 197547348216, 1513916607683, 10904464442572, 87070803499372, 673555061736062, 5718121102062336, 47028289679340734, 418812093667530755, 3680961843042545490, 34161428275433710485 (list; graph; refs; listen; history; internal format)
OFFSET

6,1

FORMULA

We obtain e.g.f. for number of partitions of n-set with m block sizes if we substitute x(i) with -Sum_{k>0} (1-exp(x^k/k!))^i in cycle index Z(S(m); x(1),x(2),..,x(n)) of symmetric group S(m) of degree m.

CROSSREFS

Cf. A038041, A088142, A122404, A005225, A005772.

Sequence in context: A063497 A096363 A033591 * A092478 A024184 A119631

Adjacent sequences:  A133115 A133116 A133117 * A133119 A133120 A133121

KEYWORD

easy,nonn

AUTHOR

Vladeta Jovovic (vladeta(AT)eunet.rs), Sep 18 2007

EXTENSIONS

More terms from Max Alekseyev (maxale(AT)gmail.com), Jun 17 2011

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 07:39 EST 2012. Contains 205881 sequences.