A071103 - OEIS

This site is supported by donations to The OEIS Foundation.

A071103

Number of perfect matchings in variant of n X n+2 Aztec rectangle graph.

12, 168, 4224, 20316160 (list; graph; refs; listen; history; internal format)

	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: A182606 A079679 A113380 * A012489 A027772 A099270` `Adjacent sequences: A071100 A071101 A071102 * A071104 A071105 A071106`
	KEYWORD	`nonn`
	AUTHOR	`N. J. A. Sloane (njas(AT)research.att.com), May 28 2002`

Content is available under The OEIS End-User License Agreement .

Last modified February 15 11:14 EST 2012. Contains 205763 sequences.