%I A054960
%S A054960 0,1,2,5,16,78,522,6168,137316,6002584,509498932,82545585936,
%T A054960 25251015681176,14527077828617744,15713242984902154384,
%U A054960 32000507852263778595584,122967932076766466336249888
%N A054960 Number of unlabeled graphs with n nodes and an odd number of edges.
%H A054960 V. A. Liskovets, <a href="http://www.cs.uwaterloo.ca/journals/JIS/index.html">
               Some easily derivable sequences</a>, J. Integer Sequences, 3 (2000), 
               #00.2.2.
%F A054960 a(n)=(A000088(n)-A000171(n))/2.
%Y A054960 Cf. A007869 for graphs with an even number of edges.
%Y A054960 Sequence in context: A002632 A020127 A121396 this_sequence A004110 A048754 
               A037075
%Y A054960 Adjacent sequences: A054957 A054958 A054959 this_sequence A054961 A054962 
               A054963
%K A054960 nonn,easy
%O A054960 1,3
%A A054960 N. J. A. Sloane (njas(AT)research.att.com), May 24 2000
%E A054960 More terms from Vladeta Jovovic (vladeta(AT)eunet.rs), Jul 19 2000