a(n) = number of digraphs (allowing loops) with vertices 1,2,...,n that have a unique Eulerian tour (up to cyclic shift).
A102692
a(n) = number of digraphs (allowing loops) with vertices 1,2,...,n that have a unique Eulerian tour (up to cyclic shift).
Terms
- a(0) =1a(1) =2a(2) =4a(3) =28a(4) =336a(5) =5808a(6) =132000a(7) =3731040a(8) =126362880a(9) =4993309440a(10) =225677975040
External references
- oeis: A102692