|
Search: id:A071106
|
|
|
| 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. |
|
+0
2
|
|
| 1, 3, 6, 1065, 6276, 45949563, 807343128, 221797080594801, 11812299253803024
(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 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: A157540 A034879 A113588 this_sequence A157548 A134901 A157564
Adjacent sequences: A071103 A071104 A071105 this_sequence A071107 A071108 A071109
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com), May 28 2002
|
|
EXTENSIONS
|
Propp gives 2 more terms.
|
|
|
Search completed in 0.002 seconds
|
