id:A037232 - OEIS Search Results

Search: id:A037232

Displaying 1-1 of 1 results found.

page 1

Number of matchings in graph C_{3} X C_{3} X P_{n}.

+0
1

370, 473888, 545223468, 633518934269, 735463713700160, 853881267896192137, 991358212180977707016, 1150970019455064994111456, 1336279754744865935702007958, 1551424939061435419705857645677 (list; graph; listen)

	OFFSET	`0,1`
	REFERENCES	`Per Hakan Lundow, "Computation of matching polynomials and the number of 1-factors in polygraphs", Research reports, No 12, 1996, Department of Mathematics, Umea University.`
	LINKS	`Per Hakan Lundow, Enumeration of matchings in polygraphs, 1998.`
	CROSSREFS	`Sequence in context: A108772 A161020 A102618 this_sequence A165330 A051182 A161362` `Adjacent sequences: A037229 A037230 A037231 this_sequence A037233 A037234 A037235`
	KEYWORD	`nonn`
	AUTHOR	`Per Hakan Lundow (phl(AT)theophys.kth.se)`

page 1

Search completed in 0.002 seconds

Last modified November 27 22:38 EST 2009. Contains 167602 sequences.

AT&T Labs Research