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!)
A326224 Number of unlabeled n-vertex digraphs (with loops) not containing a Hamiltonian path. 9
1, 2, 3, 30, 649 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
COMMENTS
A directed path is Hamiltonian if it passes through every vertex exactly once.
LINKS
Wikipedia, Hamiltonian path
FORMULA
A000595(n) = a(n) + A326221(n).
CROSSREFS
The labeled case is A326213.
The undirected case is A283420 (without loops).
Unlabeled digraphs containing a Hamiltonian path are A326221.
Unlabeled digraphs not containing a Hamiltonian cycle are A326223.
Sequence in context: A203431 A137981 A110351 * A270483 A217370 A088115
KEYWORD
nonn,more
AUTHOR
Gus Wiseman, Jun 16 2019
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 26 16:43 EDT 2024. Contains 372840 sequences. (Running on oeis4.)