A028460 Number of perfect matchings in graph P_{3} X C_{3} X P_{2n}.

1, 444, 440693, 471163403, 508635101004, 549900748355911, 594654671638397671, 643075325593489894332, 695442956730066504782459, 752075788532628446524005125, 813320598084518693275523115756, 879552861931742201382115765976449, 951178713466776585241143064515946177

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..300

Alois P. Heinz, G.f. for A028460

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

Formula

G.f.: see link above.

Crossrefs

Sequence in context: A251294 A233377 A098255 * A292139 A105985 A160583

Adjacent sequences: A028457 A028458 A028459 * A028461 A028462 A028463

Keyword

nonn

Author

Per H. Lundow

Status

approved