login
Number of simple connected graphs with n nodes that are non-integral and have no subgraph isomorphic to diamond graph.
0

%I #13 Jun 27 2014 15:09:16

%S 0,0,1,3,10,35,162,964,7682,86994

%N Number of simple connected graphs with n nodes that are non-integral and have no subgraph isomorphic to diamond graph.

%H Travis Hoppe and Anna Petrone, <a href="https://github.com/thoppe/Encyclopedia-of-Finite-Graphs">Encyclopedia of Finite Graphs</a>

%Y Cf. A242790 (diamond-free graphs), A241842 (non-integral graphs).

%K nonn,more

%O 1,4

%A _Travis Hoppe_ and _Anna Petrone_, Jun 06 2014