login
A326221
Number of unlabeled n-vertex digraphs (with loops) containing a Hamiltonian path.
9
0, 0, 7, 74, 2395
OFFSET
0,3
COMMENTS
A directed path is Hamiltonian if it passes through every vertex exactly once.
FORMULA
A000595(n) = a(n) + A326224(n).
CROSSREFS
The labeled case is A326214.
The undirected case is A057864 (without loops).
Unlabeled digraphs not containing a Hamiltonian path are A326224.
Unlabeled digraphs containing a Hamiltonian cycle are A326226.
Sequence in context: A054745 A323322 A356589 * A197091 A174243 A157706
KEYWORD
nonn,more
AUTHOR
Gus Wiseman, Jun 16 2019
STATUS
approved