id:A033515 - OEIS Search Results

Search: id:A033515

Displaying 1-1 of 1 results found.

page 1

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

+0
1

4, 32, 228, 1655, 11978, 86731, 627960, 4546684, 32919766, 238352021, 1725762060, 12495193865, 90470101964, 655039004548, 4742739182904, 34339290944491, 248629928211118, 1800178148762579, 13033995507292632 (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: A120917 A099269 A125823 this_sequence A147551 A007278 A108449` `Adjacent sequences: A033512 A033513 A033514 this_sequence A033516 A033517 A033518`
	KEYWORD	`nonn`
	AUTHOR	`Per Hakan Lundow (phl(AT)theophys.kth.se)`

page 1

Search completed in 0.002 seconds

Last modified December 6 22:55 EST 2009. Contains 170429 sequences.

AT&T Labs Research