|
| |
|
|
A071106
|
|
Number of perfect matchings in variant of right triangle graph with n edges where n runs through numbers congruent to 0 or 3 mod 4.
|
|
1
| | |
|
|
|
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 Problem 29).
|
|
|
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
| Cf. A071105.
Sequence in context: A171928 A034879 A113588 * A157548 A134901 A157564
Adjacent sequences: A071103 A071104 A071105 * A071107 A071108 A071109
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| N. J. A. Sloane (njas(AT)research.att.com), May 28 2002
|
|
|
EXTENSIONS
| Propp gives 2 more terms.
|
| |
|
|
