login
Number of unlabeled, connected graphs on n vertices with at least one subgraph isomorphic to a diamond graph.
0

%I #15 Dec 01 2015 12:02:18

%S 0,0,0,2,10,73,688,10150,253396,11629559

%N Number of unlabeled, connected graphs on n vertices with at least one subgraph isomorphic to a diamond graph.

%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

%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/DiamondGraph.html">Diamond Graph</a>

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

%K nonn,more

%O 1,4

%A _Travis Hoppe_ and _Anna Petrone_, Jun 01 2014