The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A283420 Number of simple (not necessarily connected) untraceable graphs on n nodes. 18
0, 1, 2, 6, 16, 65, 310, 2316, 26241, 522596, 18766354 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,3
LINKS
Eric Weisstein's World of Mathematics, Untraceable Graph
Wikipedia, Hamiltonian path
FORMULA
a(n) = A000088(n) - A057864(n).
CROSSREFS
Cf. A000088 (number of simple graphs on n vertices).
Cf. A057864 (number of simple traceable graphs on n vertices).
Cf. A283421 (number of simple connected untraceable graphs on n vertices).
The labeled case is A326205.
The directed case is A326224 (with loops).
Unlabeled simple graphs not containing a Hamiltonian cycle are A246446.
Sequence in context: A173994 A363587 A150032 * A121749 A009386 A009605
KEYWORD
nonn,more
AUTHOR
Eric W. Weisstein, May 14 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 21 11:30 EDT 2024. Contains 372736 sequences. (Running on oeis4.)