|
Search: id:A071105
|
|
|
| A071105 |
|
Number of perfect matchings in variant of right triangle graph with n edges. |
|
+0
2
|
|
| 1, 0, 0, 3, 6, 0, 0, 1065, 6276, 0, 0, 45949563, 807343128, 0, 0, 221797080594801, 11812299253803024, 0, 0
(list; graph; listen)
|
|
|
OFFSET
|
0,4
|
|
|
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. A071106.
Adjacent sequences: A071102 A071103 A071104 this_sequence A071106 A071107 A071108
Sequence in context: A138154 A126334 A068635 this_sequence A104613 A113565 A038023
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
njas, May 28 2002
|
|
EXTENSIONS
|
Propp gives 2 more terms.
|
|
|
Search completed in 0.002 seconds
|
