id:A033521 - OEIS Search Results

Search: id:A033521

Displaying 1-1 of 1 results found.

page 1

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

+0
1

76, 36626, 13775700, 5392866995, 2099687534810, 818177759586592, 318778982954630760, 124205035822005824254, 48393567952045732290238, 18855421270525299234217319, 7346573263558160357598269172 (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: A093238 A028480 A111682 this_sequence A060716 A116255 A136609` `Adjacent sequences: A033518 A033519 A033520 this_sequence A033522 A033523 A033524`
	KEYWORD	`nonn`
	AUTHOR	`Per Hakan Lundow (phl(AT)theophys.kth.se)`

page 1

Search completed in 0.002 seconds

Last modified November 27 14:50 EST 2009. Contains 167570 sequences.

AT&T Labs Research