A298117 Array read by antidiagonals: T(m,n) = number of Eulerian cycles in the torus grid graph C_m X C_n.
2, 4, 4, 8, 40, 8, 16, 320, 320, 16, 32, 2368, 8616, 2368, 32, 64, 16832, 207496, 207496, 16832, 64, 128, 116608, 4788808, 15639936, 4788808, 116608, 128, 256, 793088, 108326760, 1116199200, 1116199200, 108326760, 793088, 256
Offset: 1
Examples
Array begins: ========================================================================= m\n| 1 2 3 4 5 6 ---|--------------------------------------------------------------------- 1 | 2 4 8 16 32 64 ... 2 | 4 40 320 2368 16832 116608 ... 3 | 8 320 8616 207496 4788808 108326760 ... 4 | 16 2368 207496 15639936 1116199200 77643032832 ... 5 | 32 16832 4788808 1116199200 242230440480 50917973008584 ... 6 | 64 116608 108326760 77643032832 50917973008584 32098460087825856 ... ...
Links
- Andrew Howroyd, Table of n, a(n) for n = 1..105
- Eric Weisstein's World of Mathematics, Eulerian Cycle
- Eric Weisstein's World of Mathematics, Torus Grid Graph