login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,5

LINKS

Table of n, a(n) for n=1..11.

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 A155472 A100293

Adjacent sequences:  A243557 A243558 A243559 * A243561 A243562 A243563

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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 16 19:05 EDT 2021. Contains 345068 sequences. (Running on oeis4.)