|
Search: id:A071095
|
|
|
| A071095 |
|
Number of ways to tile hexagon of edges n, n+1, n+1, n, n+1, n+1 with diamonds of side 1. |
|
+0
1
|
|
| 1, 6, 175, 24696, 16818516, 55197331332, 872299918503728, 66345156372852988800, 24277282058281388285162560, 42730166102274086598901662210000, 361690697335823816369045433734882109375, 14721491647169381835282394824891766183125000000, 2880942480871157389699990094736740229925045312500000000
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
REFERENCES
|
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).
|
|
LINKS
|
J. Propp, Updated article
J. Propp, Enumeration of matchings: problems and progress, in L. J. Billera et al. (eds.), New Perspectives in Algebraic Combinatorics
|
|
FORMULA
|
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.
|
|
CROSSREFS
|
Sequence in context: A002884 A166762 A055165 this_sequence A134632 A024277 A012177
Adjacent sequences: A071092 A071093 A071094 this_sequence A071096 A071097 A071098
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com), May 28 2002
|
|
|
Search completed in 0.002 seconds
|
