login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A243250
Number of unlabeled, connected graphs on n vertices with at least one subgraph isomorphic to a diamond graph.
0
0, 0, 0, 2, 10, 73, 688, 10150, 253396, 11629559
OFFSET
1,4
LINKS
Travis Hoppe and Anna Petrone, Encyclopedia of Finite Graphs
T. Hoppe and A. Petrone, Integer sequence discovery from small graphs, arXiv preprint arXiv:1408.3644 [math.CO], 2014
Eric Weisstein's World of Mathematics, Diamond Graph
FORMULA
a(n) = A001349(n) - A242790(n).
CROSSREFS
Sequence in context: A231039 A224799 A275550 * A088189 A228609 A001395
KEYWORD
nonn,more
AUTHOR
Travis Hoppe and Anna Petrone, Jun 01 2014
STATUS
approved