The OEIS is supported by the many generous donors to the OEIS Foundation.
%I #10 Jan 23 2016 09:32:48
%S 0,0,0,0,1,4,18,85,455,2870,21280,192548
%N Number of unlabeled, connected graphs on n vertices which have no induced subgraph isomorphic to a P5, P5-bar or C5 and are not bipartite nor cobipartite and are primes.
%C P5 = path on five vertices. P5-bar = complement of P5. C5 = cycle on five vertices. Cobipartite means having a bipartite complement. G prime if G has no module (homogeneous set.)
%H F. Hüffner, <a href="https://github.com/falk-hueffner/tinygraph">tinygraph</a>, software for generating integer sequences based on graph properties.
%K more,nonn
%O 1,6
%A _Jim Nastos_, Jan 24 2003
%E a(10)-a(12) added using tinygraph by _Falk Hüffner_, Jan 23 2016