|
Search: id:A131622
|
|
|
| A131622 |
|
Number of cycles in all permutations of n elements with distinct cycle lengths. |
|
+0
1
|
|
| 1, 1, 8, 22, 124, 948, 6138, 50832, 468144, 5165280, 54704880, 695854080, 9016051680, 130427750880, 1994479744320, 32575206343680, 555499414471680, 10284817657927680, 196642556903116800, 3994718386866278400
(list; graph; listen)
|
|
|
OFFSET
|
1,3
|
|
|
FORMULA
|
E.g.f.: Sum(x^n/(n+x^n),n=1..inf)*Product(1+x^n/n,n=1..inf).
|
|
MAPLE
|
A131622 := proc(n) local su, i ; su := add(x^i/(i+x^i), i=1..n+1) ; for i from 1 to n do su := taylor(su*(1+x^i/i), x=0, n+1) ; od: n!*coeftayl(su, x=0, n) ; end: seq(A131622(n), n=1..30) ; - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Oct 25 2007
|
|
CROSSREFS
|
Cf. A000254, A007838.
Sequence in context: A083098 A033456 A026593 this_sequence A117613 A109271 A029755
Adjacent sequences: A131619 A131620 A131621 this_sequence A131623 A131624 A131625
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Vladeta Jovovic (vladeta(AT)Eunet.yu), Sep 02 2007
|
|
EXTENSIONS
|
More terms from R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Oct 25 2007
|
|
|
Search completed in 0.002 seconds
|
