login
A028487
Number of perfect matchings in graph C_{16} X P_{n}.
1
1, 2, 2209, 75272, 18241441, 1227006722, 188926707649, 16603641077888, 2122419930133441, 210276188553004802, 24741567816392584609, 2589989855253457012232, 293455063685003452121761, 31509171972656263285134338, 3508821344484462331852259329
OFFSET
0,2
COMMENTS
For even values of m the order of the recurrence relation for the number of perfect matchings in graph C_{m} X P_{n} does not exceed 2^odd(m/2)*3^floor(m/4) where odd(k)=1 for odd k and 0 otherwise. In general, as for this sequence, the estimate is accurate. - Sergey Perepechko, Sep 25 2015
REFERENCES
A.M. Karavaev, S.N. Perepechko, "Dimer problem on cylinders: recurrences and generating functions", (in Russian), Matematicheskoe Modelirovanie, 2014, V.26, No.11, pp. 18-22.
LINKS
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.
CROSSREFS
Sequence in context: A089981 A368480 A365179 * A073476 A051103 A005800
KEYWORD
nonn
AUTHOR
EXTENSIONS
a(13)-a(14) from Alois P. Heinz, Dec 10 2013
STATUS
approved