A243333 - OEIS

%I #8 Sep 14 2014 23:46:21

%S 1,1,1,1,2,5,5,9,15,38

%N Number of simple connected graphs with n nodes that are integral and K_4 free.

%C 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, 2014

%Y Cf. A064731 (integral graphs), A079574 (K_4 free graphs).

%K nonn,more

%O 1,5

%A _Travis Hoppe_ and _Anna Petrone_, Jun 03 2014