|
|
A129505
|
|
Number of permutations of 2n-1 objects with exactly n cycles.
|
|
8
|
|
|
1, 3, 35, 735, 22449, 902055, 44990231, 2681453775, 185953177553, 14710753408923, 1307535010540395, 129006659818331295, 13990945200239106865, 1654339178844590073615, 211821088794711294496815, 29197210605623737977801375, 4310704065427058593776844065
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
LINKS
|
|
|
FORMULA
|
Unsigned central Stirling numbers of the first kind:
G.f.: A(x) = Sum_{n>=0} a(n)*(2*n-1)!/n!*x^n = B'(x), where B(x) satisfies B(x)^2 = x*log(1/(1-B(x))). - Vladimir Kruchinin, Jun 10 2012
a(n) = ((2*n+1)*(-1)^n*((Sum_{i=1..n-1} (Stirling1(2*i-1,i)*C(2*n,2*i-1)*Stirling1(2*(n-i)+1,n-i))/((n-i)*C(n,i)))-n*Stirling1(2*n-1,n) + Stirling1(2*n,n)))/(n+1). - Vladimir Kruchinin, Feb 28 2013
a(n) ~ (1+2*c)/(8*c*sqrt(Pi*(-1-c))) * (-8*c^2/(exp(1)*(1+2*c)))^n * n^(n-3/2), where c = LambertW(-1,-1/(2*exp(1/2))). - Vaclav Kotesovec, Dec 28 2013
|
|
MATHEMATICA
|
t[n_] := SymmetricPolynomial[n, Range[1, 2 n]]
Table[t[n], {n, 1, 6}] (* A129505 *)
Table[Abs[StirlingS1[2*n-1, n]], {n, 1, 20}] (* Vaclav Kotesovec, Dec 28 2013 *)
|
|
PROG
|
(PARI) a(n)=polcoeff(prod(k=0, 2*n-2, 1+k*x), n-1)
(PARI) vector(66, n, abs( stirling(2*n-1, n, 1) ) ) /* Joerg Arndt, Jun 09 2012 */
(Maxima)
a(n):=((2*n+1)*(-1)^n*((sum((stirling1(2*i-1, i)*binomial(2*n, 2*i-1)* stirling1(2*(n-i)+1, n-i))/((n-i)*binomial(n, i)), i, 1, n-1)) -n*stirling1(2*n-1, n) +stirling1(2*n, n)))/(n+1); /* Vladimir Kruchinin, Feb 28 2013 */
(Maxima) a(n):=coeff(expand(product(x+i, i, 1, 2*(n-1))), x, (n-1)); /* Lorraine Lee, Oct 12 2019 */
(Haskell)
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|