[go: up one dir, main page]
login
The OEIS is supported by the many generous donors to the OEIS Foundation.
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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
(list; graph; refs; listen; history; text; internal format)
OFFSET
1,6
LINKS
Table of n, a(n) for n=1..14.
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
Adjacent sequences: A243272 A243273 A243274 * A243276 A243277 A243278
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

Lookup Welcome Wiki Register Music Plot 2 Demos Index WebCam Contribute Format Style Sheet Transforms Superseeker Recents
The OEIS Community
Maintained by The OEIS Foundation Inc.
Last modified October 5 04:48 EDT 2024. Contains 376530 sequences.
License Agreements, Terms of Use, Privacy Policy