|
%I #18 Aug 27 2019 10:11:31
%S 1,2,8,88,3928,688336,438953344,1023160206720,8829110851362176,
%T 284886609918484446976,34640035331694391965082624,
%U 15970703846423879100652101753856,28060860469435555251136195653129640960,188681219498365676664628141013181402003089408
%N Number of labeled Eulerian digraphs with n nodes and an even number of edges.
%H V. A. Liskovets, <a href="http://www.cs.uwaterloo.ca/journals/JIS/VOL3/LISK/Derseq.html">Some easily derivable sequences</a>, J. Integer Sequences, 3 (2000), #00.2.2.
%F a(n) = (A007080(n) + n!)/2. - _Andrew Howroyd_, Sep 10 2018
%t A007080 = Cases[Import["https://oeis.org/A007080/b007080.txt", "Table"], {_, _}][[All, 2]];
%t a[n_] := (A007080[[n]] + n!)/2;
%t Array[a, 14] (* _Jean-François Alcover_, Aug 27 2019 *)
%Y Cf. A007080, A054956.
%K nonn,easy
%O 1,2
%A _N. J. A. Sloane_, May 24 2000
%E More terms from _Vladeta Jovovic_, Mar 05 2001
%E a(12)-a(14) from _Andrew Howroyd_, Sep 10 2018
|
