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

A243275
Number of graphs with n nodes that are Hamiltonian and triangle-free.
0
1, 0, 0, 1, 1, 4, 5, 35, 130, 1293, 13529, 232852, 5009335, 147950020
OFFSET
1,6
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. A003216 (Hamiltonian graphs), A024607 (connected triangle-free graphs).
Sequence in context: A151450 A243772 A332316 * A269782 A131139 A152291
KEYWORD
nonn,more
AUTHOR
Travis Hoppe and Anna Petrone, Jun 02 2014
EXTENSIONS
a(11)-a(14) added using tinygraph by Falk Hüffner, Aug 15 2017
STATUS
approved