|
%I #16 Jul 27 2016 19:25:06
%S 0,1,1,22,352,13412,932768,125776816,33148125376,17248244478848,
%T 17820828772662272,36677298103403269504,150636101324831804975104,
%U 1235824405515221870758956032,20263840468865240117261288526848,664289479167891600504170147259897856
%N Number of connected labeled graphs with n nodes and an odd 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) = (A001187(n)+(-1)^n*A000142(n-1))/2.
%t nn = 15; Clear[f];f[z_] := Sum[(1 + u)^Binomial[n, 2] z^n/n!, {n, 0, nn + 1}]; Drop[Map[Total[#[[2 ;; Binomial[nn, 2] ;; 2]]] &,Range[0, nn]! CoefficientList[Series[ Log[f[z]] , {z, 0, nn}], {z, u}]], 1] (* _Geoffrey Critzer_, Jul 27 2016 *)
%Y Cf. A054939.
%K nonn,easy
%O 1,4
%A _N. J. A. Sloane_, May 24 2000
%E More terms from _Vladeta Jovovic_, Jul 17 2000
|
