|
%I #9 Jan 11 2018 23:42:08
%S 1,40,132160,33565612800,641149227424067584,
%T 911979417737022109612195840,96089134887576552087085389330051891200,
%U 747578503218020593242369202628724536730457230016512
%N Number of Eulerian cycles in a lattice graph bounded by the eight equations x+y=-2n, x+y=2n, x-y=-2n, x-y=2n, x=1-2n, x=2n-1, y=1-2n, and y=2n-1 (Aztec Diamond graph).
%H P. Audibert, <a href="http://as.wiley.com/WileyCDA/WileyTitle/productCd-1848211961.html">Mathematics for Informatics and Computer Science</a>, Wiley, 2010, p. 832.
%H Muhammad Kholilurrohman and Shin-ichi Minato, <a href="http://www-alg.ist.hokudai.ac.jp/~thomas/TCSTR/tcstr_14_77/tcstr_14_77.pdf">An Efficient Algorithm for Enumerating Eulerian Paths</a>, Hokkaido University, Division of Computer Science, TCS Technical Reports, TCS-TR-A-14-77, Oct. 2014.
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/EulerianCycle.html">Eulerian Cycle</a>
%K nonn
%O 1,2
%A _Muhammad Kholilurrohman_, Dec 26 2014
|
