126362880

Appears in sequences

• a(n) = number of digraphs (allowing loops) with vertices 1,2,...,n that have a unique Eulerian tour (up to cyclic shift).at n=8A102692