%I
%S 1,0,1,1,2,9,27,190,1750,25658,531204
%N Number of simple connected graphs with n nodes that are Hamiltonian and have no subgraph isomorphic to diamond graph.
%H Travis Hoppe and Anna Petrone, <a href="https://github.com/thoppe/EncyclopediaofFiniteGraphs">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 F. Hüffner, <a href="https://github.com/falkhueffner/tinygraph">tinygraph</a>, software for generating integer sequences based on graph properties, version a1db88e
%Y Cf. A242790 (diamond free graphs), A003216 (Hamiltonian graphs).
%K nonn,more
%O 1,5
%A _Travis Hoppe_ and _Anna Petrone_, Jun 06 2014
%E a(11) added using tinygraph by _Falk Hüffner_, Aug 15 2017
