%I A054926
%S A054926 1,0,0,2,5,19,132,1579,33366
%N A054926 Number of connected unlabeled graphs with n nodes and floor(n*(n-1)/4) 
               edges.
%H A054926 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.
%Y A054926 Can be read off rows of A054924.
%Y A054926 Sequence in context: A107882 A089126 A113346 this_sequence A002786 A039719 
               A014466
%Y A054926 Adjacent sequences: A054923 A054924 A054925 this_sequence A054927 A054928 
               A054929
%K A054926 nonn,easy
%O A054926 1,4
%A A054926 N. J. A. Sloane (njas(AT)research.att.com), May 24 2000
%E A054926 Description corrected by David Wasserman (wasserma(AT)spawar.navy.mil), 
               Mar 05 2002