A369820 Number of (undirected) Eulerian circuits on the complete graph K_{2n+1}.

1, 132, 64988160, 455760028510617600, 128663499619046483713892580065280, 3352855075715829436523159831078082969600000000000000, 16066479367821778463055998145740101703072909829920380472524800000000000000000

Offset: 1

Author

Eric W. Weisstein, Feb 02 2024

Keywords

• nonn

Links

• Eric Weisstein's World of Mathematics, Complete Graph
• Eric Weisstein's World of Mathematics, Eulerian Cycle

Crossrefs

Cf. A135388 (directed Eulerian circuits)

Formula

a(n) = A135388(n)/2.