%I #14 Mar 07 2016 14:24:39
%S 2,8,160,4608,393216,37748736,11022630912,5315022028800,
%T 6333186975989760,10808639105689190400,48595641419178600038400,
%U 381803330140010815527321600,6932464219998129539435095654400
%N Number of ways to tile Aztec diamond of order n with 2 squares removed with dominoes.
%D J. Propp, Enumeration of matchings: problems and progress, pp. 255-291 in L. J. Billera et al., eds, New Perspectives in Algebraic Combinatorics, Cambridge, 1999 (see Problem 7).
%H J. Propp, <a href="http://faculty.uml.edu/jpropp/update.pdf">Updated article</a>
%H J. Propp, Enumeration of matchings: problems and progress, in L. J. Billera et al. (eds.), <a href="http://www.msri.org/publications/books/Book38/contents.html">New Perspectives in Algebraic Combinatorics</a>
%e From _Andrew Howroyd_, Mar 07 2016: (Start)
%e The 2 removed squares are central and separated by a knights move.
%e Illustration of n = 4:
%e * ++
%e * ++++
%e * ++++++
%e * +++++ ++
%e * +++ ++++
%e * ++++++
%e * ++++
%e * ++
%e (End)
%K nonn
%O 2,1
%A _N. J. A. Sloane_, May 28 2002
%E a(11)-a(14) from _Andrew Howroyd_, Mar 07 2016