Number of Eulerian circuits on the complete graph K_{2n+1}, divided by (n-1)!^(2n+1).
A007082
Number of Eulerian circuits on the complete graph K_{2n+1}, divided by (n-1)!^(2n+1).
Terms
- a(0) =2a(1) =264a(2) =1015440a(3) =90449251200
External references
- oeis: A007082