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”).

A243560
Number of simple connected graphs with n nodes that are Hamiltonian and have no subgraph isomorphic to diamond graph.
0
1, 0, 1, 1, 2, 9, 27, 190, 1750, 25658, 531204
OFFSET
1,5
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.
F. Hüffner, tinygraph, software for generating integer sequences based on graph properties, version a1db88e
CROSSREFS
Cf. A242790 (diamond free graphs), A003216 (Hamiltonian graphs).
Sequence in context: A327612 A019065 A115186 * A090900 A357721 A155472
KEYWORD
nonn,more
AUTHOR
Travis Hoppe and Anna Petrone, Jun 06 2014
EXTENSIONS
a(11) added using tinygraph by Falk Hüffner, Aug 15 2017
STATUS
approved