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!)
A264683 Number of simple graphs on n nodes which satisfy the Ore criterion for Hamiltonicity. 3
1, 1, 1, 3, 5, 21, 68, 503, 4942, 128361 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,4

COMMENTS

Includes complete graphs K_n according to the "vacuous truth" convention that statements like "for all X in Y: P(X)" are true if Y is the empty set.

LINKS

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

Eric Weisstein's World of Mathematics, Ore Graph

Eric Weisstein's World of Mathematics, Ore's Theorem

CROSSREFS

Cf. A264683 (number of Hamiltonian graphs not satisfying Ore's criterion).

Sequence in context: A235136 A153862 A266203 * A286033 A056803 A071706

Adjacent sequences:  A264680 A264681 A264682 * A264684 A264685 A264686

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 August 4 09:03 EDT 2020. Contains 336201 sequences. (Running on oeis4.)