|
Search: id:A071093
|
|
|
| A071093 |
|
Number of matchings in triangle graph with n nodes per side as n runs through numbers congruent to 0 or 3 mod 4. |
|
+0
2
|
|
| 1, 2, 6, 2196, 37004, 2317631400, 216893681800, 2326335506123418128, 1208982377794384163088
(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 17).
|
|
LINKS
|
J. Propp, Twenty open problems in enumeration of matchings.
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. A039907.
Sequence in context: A046857 A129454 A140258 this_sequence A114045 A116899 A055698
Adjacent sequences: A071090 A071091 A071092 this_sequence A071094 A071095 A071096
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
njas
|
|
|
Search completed in 0.002 seconds
|
