Isomorphism classes of connected Eulerian digraphs with n vertices, allowing loops.

A308128

Isomorphism classes of connected Eulerian digraphs with n vertices, allowing loops.

Terms

    a(0) =1a(1) =2a(2) =3a(3) =14a(4) =112a(5) =2174a(6) =124501a(7) =22400498a(8) =13010949171

External references