OFFSET
0,2
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
KEYWORD
nonn
AUTHOR
STATUS
approved