A369821 Number of (undirected) Eulerian cycles in the n-Dorogovtsev-Goltsev-Mendes graph.
0, 1, 16, 10146816, 24578010504157244424192000000
Offset: 0
Keywords
Links
- Andrew Howroyd, Table of n, a(n) for n = 0..6
- Eric Weisstein's World of Mathematics, Dorogovtsev-Goltsev-Mendes Graph.
- Eric Weisstein's World of Mathematics, Eulerian Cycle.
Crossrefs
Cf. A368190.
Extensions
a(4) onwards from Andrew Howroyd, Jun 09 2025
Comments