A028458 Number of perfect matchings in graph P_{2} X C_{6} X P_{n}.

1, 20, 3108, 297296, 31937617, 3350337360, 353544256465, 37264079953664, 3928877032323636, 414211112701109036, 43669866502128209569, 4604058193083952217472, 485400369515158307543761, 51175176191003066916312572, 5395337413785403025694582228

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

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

Crossrefs

Sequence in context: A222750 A250019 A145405 * A225989 A332265 A177323

Adjacent sequences: A028455 A028456 A028457 * A028459 A028460 A028461

Keyword

nonn

Author

Per H. Lundow

Status

approved