login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A133119
Number of permutations of [n] with 3 cycle lengths.
2
120, 1050, 12712, 141876, 1418400, 17061660, 212254548, 2735287698, 37354035628, 581350330470, 8895742806480, 151305163230480, 2659183039338192, 50112909523522476, 976443721325014300, 20413628375979803370, 434137453618439716068
OFFSET
6,1
LINKS
FORMULA
We obtain e.g.f. for number of permutations of [n] with m cycle lengths 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(m)) of symmetric group S(m) of degree m.
CROSSREFS
Column k=3 of A218868.
Sequence in context: A213875 A092182 A262387 * A052777 A052765 A265091
KEYWORD
easy,nonn
AUTHOR
Vladeta Jovovic, Sep 18 2007
EXTENSIONS
More terms from Max Alekseyev, Feb 08 2010
STATUS
approved