id:A033525 - OEIS Search Results

Search: id:A033525

Displaying 1-1 of 1 results found.

page 1

Number of matchings in graph C_{13} X P_{n}

+0
1

521, 3909830, 20515048427, 114049219978023, 629054823210684476, 3473775971752370727131, 19179686041473059942755365, 105899042012449225094998682338, 584710646991236367599977270008305 (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: A015291 A028484 A057699 this_sequence A138647 A045050 A004968` `Adjacent sequences: A033522 A033523 A033524 this_sequence A033526 A033527 A033528`
	KEYWORD	`nonn`
	AUTHOR	`Per Hakan Lundow (phl(AT)theophys.kth.se)`

page 1

Search completed in 0.002 seconds

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.

AT&T Labs Research