%I #10 Sep 14 2014 23:15:22
%S 1,1,2,6,20,107,802,10252,232850,9905775
%N Number of unlabeled, connected graphs on n vertices with no induced subgraph isomorphic to a K_5, where a K_5 is the complete graph on five vertices.
%H Travis Hoppe and Anna Petrone, <a href="https://github.com/thoppe/Encyclopedia-of-Finite-Graphs">Encyclopedia of Finite Graphs</a>
%H T. Hoppe and A. Petrone, <a href="http://arxiv.org/abs/1408.3644">Integer sequence discovery from small graphs</a>, arXiv preprint arXiv:1408.3644, 2014
%Y Cf. similar graphs that are K_4 free, A079574.
%K nonn,hard,more
%O 1,3
%A _Travis Hoppe_ and _Anna Petrone_, Apr 28 2014