A028457 Number of perfect matchings in graph P_{2} X C_{5} X P_{n}.

1, 11, 722, 29213, 1347920, 60155908, 2711547333, 121926974411, 5486824130234, 246868369783200, 11108030731300009, 499808090143585644, 22489082779271197033, 1011905249122931313347, 45531100591422826963680, 2048690851721548318510817, 92181702636263275774030197

Offset

0,2

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

Alois P. Heinz, Table of n, a(n) for n = 0..500

Per Hakan Lundow, Enumeration of matchings in polygraphs, 1998.

Crossrefs

Sequence in context: A218716 A232355 A301732 * A222653 A204974 A204701

Adjacent sequences: A028454 A028455 A028456 * A028458 A028459 A028460

Keyword

nonn

Author

Per H. Lundow

Status

approved