The OEIS is supported by the many generous donors to the OEIS Foundation.
Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
%I #13 Jul 01 2018 03:51:25
%S 1,2,4,11,32,128,608,3689,27238,244922,2659678,35013106,562450090
%N Number of HHD-free graphs on n nodes.
%C A graph is called HHD-free if it does not contain a house, a hole of length at least five or a domino as an induced subgraph. All HHD-free graphs are perfect. - _Falk Hüffner_, Jul 01 2018
%H S. Hougardy, <a href="http://dx.doi.org/10.1016/j.disc.2006.05.021">Classes of perfect graphs</a>, Discr. Math. 306 (2006), 2529-2571.
%H F. Hüffner, <a href="https://github.com/falk-hueffner/tinygraph">tinygraph</a>, software for generating integer sequences based on graph properties, version 6c1dbe4.
%K nonn,more
%O 1,2
%A _N. J. A. Sloane_, Oct 18 2006
%E a(11)-a(13) added using tinygraph by _Falk Hüffner_, Jul 01 2018