login
Number of unlabeled, connected graphs on n vertices with at least one induced subgraph isomorphic to a K_4, where K_4 is the complete graph on four vertices.
0

%I #19 Aug 15 2021 14:51:54

%S 0,0,0,1,4,30,317,5511,165165,8932499,870814993,153082769374,

%T 48887756906623

%N Number of unlabeled, connected graphs on n vertices with at least one induced subgraph isomorphic to a K_4, where K_4 is the complete graph on four 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 [math.CO], 2014.

%F a(n) = A001349(n) - A079574(n).

%K nonn,more

%O 1,5

%A _Travis Hoppe_ and _Anna Petrone_, Jun 01 2014

%E a(11) and a(12) from formula by _Falk Hüffner_, Jan 14 2016

%E a(13) from formula by _Falk Hüffner_, Aug 15 2021