A102693
a(n) is the number of digraphs (not allowing loops) with vertices 1,2,…,n that have a unique Eulerian tour (up to cyclic shift).
offset: 2
codomain: ℕ
Declarations
Section titled “Declarations”- A102693computable
a(n) is the number of digraphs (not allowing loops) with vertices 1,2,…,n that have a unique Eulerian tour (up to cyclic shift).