|
%I #22 Mar 08 2016 10:43:54
%S 1,34,7573,1222550,211351945,36012826776,6158217253688,
%T 1052091957273408,179788343101980135,30721240815429999078,
%U 5249581929453966097649,897032469743945346623442,153282416794739031814924079,26192460807219455656314349664
%N Number of matchings in graph P_{8} X P_{n}.
%H Alois P. Heinz, <a href="/A033511/b033511.txt">Table of n, a(n) for n = 0..450</a>
%H Per Hakan Lundow, <a href="http://www.theophys.kth.se/~phl/Text/1factors.pdf">Computation of matching polynomials and the number of 1-factors in polygraphs</a>, Research report, No 12, 1996, Department of Math., Umea University, Sweden.
%H Per Hakan Lundow, <a href="http://www.theophys.kth.se/~phl/Text/1factors2.ps.gz">Enumeration of matchings in polygraphs</a>, 1998.
%H Sergey Perepechko, <a href="/A033511/a033511.pdf">Generating function</a>
%Y Column 8 of triangle A210662.
%Y Bisection (even part) gives A260036.
%K nonn
%O 0,2
%A _Per H. Lundow_
| 