|
%I #9 Dec 01 2015 11:50:23
%S 0,0,0,0,1,5,51,865,28230,1810796
%N Number of unlabeled, connected graphs on n vertices with at least one induced subgraph isomorphic to a K_5, where 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>
%F a(n) = A001349(n) - A241782(n).
%K nonn,more
%O 1,6
%A _Travis Hoppe_ and _Anna Petrone_, Jun 01 2014
|
