Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A133119
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A133119 Number of permutations of [n] with 3 cycle lengths. +0
1
120, 1050, 12712, 141876, 1418400, 17061660, 212254548, 2735287698, 37354035628, 581350330470, 8895742806480 (list; graph; listen)
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 this_sequence A052777 A052765 A052776

Adjacent sequences: A133116 A133117 A133118 this_sequence A133120 A133121 A133122

KEYWORD

easy,more,nonn

AUTHOR

Vladeta Jovovic (vladeta(AT)Eunet.yu), Sep 18 2007

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified July 25 07:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research