|
%I #11 Jun 17 2019 03:33:01
%S 0,1,1,4,61,3725,844141,626078904
%N Number of Hamiltonian unlabeled n-vertex digraphs (without loops).
%C A digraph is Hamiltonian if it contains a directed cycle passing through every vertex exactly once.
%H Sean A. Irvine, <a href="/A326225/a326225.txt">Non-isomorphic representatives of the a(5) = 3725 non-Hamiltonian digraphs (without loops)</a>
%H Gus Wiseman, <a href="/A326225/a326225.png">Non-isomorphic representatives of the a(4) = 61 non-Hamiltonian digraphs (without loops)</a>
%e Non-isomorphic representatives of the a(3) = 4 digraph edge-sets:
%e {12,23,31}
%e {12,13,21,32}
%e {12,13,21,23,31}
%e {12,13,21,23,31,32}
%Y The labeled case is A326219.
%Y The case with loops is A326226.
%Y The undirected case is A003216.
%Y Non-Hamiltonian unlabeled digraphs (without loops) are A326222.
%Y Cf. A000595, A002416, A003087, A003216, A053763, A246446, A326204, A326218, A326223.
%K nonn,hard,more
%O 0,4
%A _Gus Wiseman_, Jun 15 2019
%E a(5)-a(7) from _Sean A. Irvine_, Jun 16 2019
|
