OFFSET
0,3
COMMENTS
abs(a(n)) is the number of cycles in all permutations of n elements with an even number of cycles. - Vladeta Jovovic, Sep 06 2007
LINKS
G. C. Greubel, Table of n, a(n) for n = 0..448
FORMULA
E.g.f.: (1+x)*x/2*U(0) where U(k)= 1 - 1/((1+x)^2 - x*(1+x)^4*(k+1)/(x*(1+x)^2*(k+1) + (k+2)/U(k+1))) ; (continued fraction, 3rd kind, 3-step). - Sergei N. Gladkovskii, Sep 25 2012
a(n) ~ n! * (-1)^n * log(n) / 2 * (1 + gamma/log(n)), where gamma is the Euler-Mascheroni constant (A001620). - Vaclav Kotesovec, Jan 24 2015
EXAMPLE
a(n) = ((-1)^n*(n!*h(n) + (n-2)!))/2, n > 1, where h(n) = Sum_{k=1..n} 1/k. - Gary Detlefs, Aug 31 2011
MATHEMATICA
nn=30; Range[0, nn]! CoefficientList[Series[Sinh[Log[1 + x]]*Log[1 + x], {x, 0, nn}], x]
CoefficientList[Series[(x*(2 + x)*Log[1 + x])/(2*(1 + x)), {x, 0, 20}], x] * Range[0, 20]! (* Vaclav Kotesovec, Jan 24 2015 *)
PROG
(PARI) x='x+O('x^66);
concat([0, 0], Vec(serlaplace(sinh(log(1+x))*log(1+x))))
CROSSREFS
KEYWORD
sign,easy
AUTHOR
EXTENSIONS
Extended with signs by Olivier Gérard, Mar 15 1997
STATUS
approved