

A326221


Number of unlabeled nvertex digraphs (with loops) containing a Hamiltonian path.


9




OFFSET

0,3


COMMENTS

A directed path is Hamiltonian if it passes through every vertex exactly once.


LINKS



FORMULA



CROSSREFS

The undirected case is A057864 (without loops).
Unlabeled digraphs not containing a Hamiltonian path are A326224.
Unlabeled digraphs containing a Hamiltonian cycle are A326226.


KEYWORD

nonn,more


AUTHOR



STATUS

approved



