login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A264684 Number of simple Hamiltonian graphs on n nodes which do not satisfy the Ore criterion for Hamiltonicity. 0
0, 0, 0, 0, 3, 27, 315, 5693, 172141, 9176757 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,5

COMMENTS

Using the "vacuous truth" convention so that complete graphs K_n are considered to be Ore graphs.

LINKS

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

Eric Weisstein's World of Mathematics, Ore Graph

CROSSREFS

Cf. A264683 (number of simple graphs which satisfy the Ore criterion for Hamiltonicity).

Cf. A003216 (number of simple Hamiltonian graphs).

Sequence in context: A290576 A291315 A078532 * A217363 A234462 A153853

Adjacent sequences:  A264681 A264682 A264683 * A264685 A264686 A264687

KEYWORD

nonn,more

AUTHOR

Eric W. Weisstein, Dec 03 2015

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 November 20 10:09 EST 2019. Contains 329334 sequences. (Running on oeis4.)