|
| |
|
|
A028456
|
|
Number of perfect matchings in graph P_{2} X C_{4} X P_{n}.
|
|
0
| |
|
|
9, 272, 6345, 155969, 3794880, 92524801, 2254970505, 54961579408, 1339585632201, 32649998822849, 795784687676160, 19395815427419969, 472737980834179401, 11522134787497383568, 280831232750814806025
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,1
|
|
|
REFERENCES
| Per Hakan Lundow, "Computation of matching polynomials and the number of 1-factors in polygraphs", Research report, No 12, 1996, Department of Math., Umea University, Sweden.
|
|
|
LINKS
| Per Hakan Lundow, Enumeration of matchings in polygraphs, 1998.
|
|
|
CROSSREFS
| Sequence in context: A088672 A157571 A202689 * A180358 A197597 A197981
Adjacent sequences: A028453 A028454 A028455 * A028457 A028458 A028459
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Per Hakan Lundow (phl(AT)theophys.kth.se)
|
| |
|
|
