|
Search: id:A071097
|
|
|
| A071097 |
|
Number of ways to tile Aztec diamond of order n with 2 squares removed with dominoes. |
|
+0
1
|
|
| 2, 8, 160, 4608, 393216, 37748736, 11022630912, 5315022028800, 6333186975989760
(list; graph; listen)
|
|
|
OFFSET
|
2,1
|
|
|
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 Problem 7).
|
|
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
|
|
CROSSREFS
|
Sequence in context: A012571 A018926 A012432 this_sequence A012537 A012540 A009606
Adjacent sequences: A071094 A071095 A071096 this_sequence A071098 A071099 A071100
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com), May 28 2002
|
|
|
Search completed in 0.002 seconds
|
