%I #25 Jan 23 2016 11:24:04
%S 1,1,2,6,20,93,515,3701,32714,359289,4847830,80064871,1607606989,
%T 38983675574
%N Number of (simple, undirected, unlabeled, connected) graphs with n vertices which contain no induced subgraph isomorphic to the complement of P5 (the "house" graph).
%C Also, number of (simple, undirected, unlabeled, connected) graphs with n vertices which contain no induced subgraph isomorphic to a P5 (the path on 5 vertices). - _Falk Hüffner_, Nov 27 2015
%H Maria Chudnovsky, Jan Goedgebeur, Oliver Schaudt, Mingxian Zhong, <a href="http://arxiv.org/abs/1504.06979">Obstructions for three-coloring graphs without induced paths on six vertices</a>, arXiv preprint arXiv:1504.06979 [math.CO], 2015.
%H F. Hüffner, <a href="https://github.com/falk-hueffner/tinygraph">tinygraph</a>, software for generating integer sequences based on graph properties, version 8489dde.
%K more,nonn
%O 1,3
%A _Jim Nastos_, Jan 07 2003
%E Corrected by _Jim Nastos_, Jan 20 2003
%E a(10)..a(14) from _Falk Hüffner_, Jan 13 2016