Number of digraphs with indegree = outdegree at each vertex, or Eulerian digraphs (including disconnected graphs) with n nodes.

A058338

Number of digraphs with indegree = outdegree at each vertex, or Eulerian digraphs (including disconnected graphs) with n nodes.

Terms

    a(0) =1a(1) =1a(2) =2a(3) =5a(4) =18a(5) =111a(6) =2292a(7) =181519a(8) =51294836a(9) =48814342597

External references