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

%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/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

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 July 26 20:34 EDT 2021. Contains 346295 sequences. (Running on oeis4.)