|
%I #11 Dec 09 2013 21:21:07
%S 1,2,49,392,5041,51842,591361,6422528,71385601,784792962,8672638129,
%T 95605150088,1055154220849,11638893993218,128416422417409,
%U 1416693454733312,15629912636083201,172434918695682818,1902390033466290481,20988007893796680072,231549660454953439921
%N Number of perfect matchings in graph C_{8} X P_{n}.
%D 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.
%H Alois P. Heinz, <a href="/A028479/b028479.txt">Table of n, a(n) for n = 0..900</a>
%H Per Hakan Lundow, <a href="http://www.theophys.kth.se/~phl/Text/1factors2.ps.gz">Enumeration of matchings in polygraphs</a>, 1998.
%F G.f.: -(x^7-5*x^6 -21*x^5 +41*x^4 +41*x^3 -21*x^2 -5*x +1) / (x^9 -7*x^8 -56*x^7 +104*x^6 +280*x^5 -280*x^4 -104*x^3 +56*x^2 +7*x -1). - _Alois P. Heinz_, Dec 09 2013
%K nonn,easy
%O 0,2
%A _Per H. Lundow_
|
