%I A071095
%S A071095 1,6,175,24696,16818516,55197331332,872299918503728,66345156372852988800,
%T A071095 24277282058281388285162560,42730166102274086598901662210000,361690697335823816369045433734882109375,
%U A071095 14721491647169381835282394824891766183125000000,2880942480871157389699990094736740229925045312500000000
%N A071095 Number of ways to tile hexagon of edges n, n+1, n+1, n, n+1, n+1 with 
               diamonds of side 1.
%D A071095 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 page 261).
%H A071095 J. Propp, <a href="http://math.wisc.edu/~propp/update.ps.gz">Updated 
               article</a>
%H A071095 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>
%F A071095 Product_{i=0..a-1} Product_{j=0..b-1} Product_{k=0..c-1} (i+j+k+2)/(i+j+k+1) 
               with a=n, b=c=n+1.
%Y A071095 Sequence in context: A002884 A166762 A055165 this_sequence A134632 A024277 
               A012177
%Y A071095 Adjacent sequences: A071092 A071093 A071094 this_sequence A071096 A071097 
               A071098
%K A071095 nonn
%O A071095 0,2
%A A071095 N. J. A. Sloane (njas(AT)research.att.com), May 28 2002