|
%I #10 Feb 08 2017 05:32:18
%S 1,1,1,41,1121,80977,5073377,984765497,131026429249,45819745767329,
%T 9199822716980033,5303459200225973833,1646226697154555000993,
%U 1377111876294420026771441,574027598120143165861124641,675477754387947155701063431257,381022545331716847279242552317057
%N Number of degree-2n permutations without even cycles and such that number of cycles of size 2k-1 is even (or zero) for every k.
%H Alois P. Heinz, <a href="/A130639/b130639.txt">Table of n, a(n) for n = 0..220</a>
%F E.g.f.: Product_{k>0} cosh(x^(2*k-1)/(2*k-1)).
%e a(2)=1 because we have (1)(2)(3)(4).
%p g:=product(cosh(x^(2*k-1)/(2*k-1)),k=1..40): gser:=series(g,x=0,35): seq(factorial(2*n)*coeff(gser,x,2*n),n=0..14); # _Emeric Deutsch_, Aug 25 2007
%p # second Maple program:
%p with(combinat):
%p b:= proc(n, i) option remember; `if`(n=0, 1, `if`(i<1, 0, add(
%p `if`(j=0 or irem(i, 2)=1 and irem(j, 2)=0, multinomial(n,
%p n-i*j, i$j)*(i-1)!^j/j!*b(n-i*j, i-1), 0), j=0..n/i)))
%p end:
%p a:= n-> b(2*n$2):
%p seq(a(n), n=0..20); # _Alois P. Heinz_, Mar 09 2015
%t multinomial[n_, k_] := n!/Times @@ (k!); b[n_, i_] := b[n, i] = If[n == 0, 1, If[i<1, 0, Sum[If[j == 0 || Mod[i, 2] == 1 && Mod[j, 2] == 0, multinomial[n, Join[{n-i*j}, Array[i&, j]]]*(i-1)!^j/j!*b[n-i*j, i-1], 0], {j, 0, n/i}]]]; a[n_] := b[2n, 2n]; Table[a[n], {n, 0, 20}] (* _Jean-François Alcover_, Feb 08 2017, after _Alois P. Heinz_ *)
%Y Cf. A060307.
%K easy,nonn
%O 0,4
%A _Vladeta Jovovic_, Aug 11 2007
%E More terms from _Emeric Deutsch_, Aug 25 2007
|
