|
| |
|
|
A071097
|
|
Number of ways to tile Aztec diamond of order n with 2 squares removed with dominoes.
|
|
0
| | |
|
|
|
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 * A012537 A012540 A175538
Adjacent sequences: A071094 A071095 A071096 * A071098 A071099 A071100
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| N. J. A. Sloane (njas(AT)research.att.com), May 28 2002
|
| |
|
|
