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”).
%I #20 Aug 15 2017 13:55:09
%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/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 F. Hüffner, <a href="https://github.com/falk-hueffner/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