|
Search: id:A071104
|
|
|
| A071104 |
|
Number of perfect matchings in variant of 2n-1 X 2n Aztec rectangle graph. |
|
+0
1
|
| |
|
|
OFFSET
|
1,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 28).
|
|
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: A093786 A048632 A120104 this_sequence A087700 A107666 A020466
Adjacent sequences: A071101 A071102 A071103 this_sequence A071105 A071106 A071107
|
|
KEYWORD
|
nonn,bref
|
|
AUTHOR
|
njas, May 28 2002
|
|
|
Search completed in 0.002 seconds
|
