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

1, 13, 1681, 112485, 9049169, 692276437, 53786626921, 4161756233501, 322462050747008, 24976513162427653, 1934824269280528177, 149878484960033943221, 11610280860482785441201, 899384302182455890904869, 69670430204782040731619473, 5396990358379369075151309301

Offset: 0

Author

Per H. Lundow

Keywords

• nonn

Comments

This sequence satisfies a recurrence relation of order 213. - Sergey Perepechko, Jul 07 2019

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.
• A. M. Karavaev and S. N. Perepechko, Dimer problem on two-layer rectangular grid graph, (in Russian) CMMASS'2013 slides
• Sergey Perepechko, Generating function in Maple notation
• Sergey Perepechko, Generating function in text format

Crossrefs

Column k=6 of A181206.