|
| |
|
|
A133119
|
|
Number of permutations of [n] with 3 cycle lengths.
|
|
0
| |
|
|
120, 1050, 12712, 141876, 1418400, 17061660, 212254548, 2735287698, 37354035628, 581350330470, 8895742806480, 151305163230480, 2659183039338192, 50112909523522476, 976443721325014300, 20413628375979803370, 434137453618439716068
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 6,1
|
|
|
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
| Cf. A005225, A005772, A038041, A088142.
Sequence in context: A029573 A011245 A092182 * A052777 A052765 A167549
Adjacent sequences: A133116 A133117 A133118 * A133120 A133121 A133122
|
|
|
KEYWORD
| easy,nonn
|
|
|
AUTHOR
| Vladeta Jovovic (vladeta(AT)eunet.rs), Sep 18 2007
|
|
|
EXTENSIONS
| More terms from Max Alekseyev (maxale(AT)gmail.com), Feb 08 2010
|
| |
|
|
