%I #7 Dec 09 2013 18:32:57
%S 1,9,5051532105
%N Number of perfect matchings in graph P_{2n} X P_{2n} X P_{2n}.
%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 Per Hakan Lundow, <a href="http://www.theophys.kth.se/~phl/Text/1factors2.ps.gz">Enumeration of matchings in polygraphs</a>, 1998.
%K nonn,bref,more
%O 0,2
%A _Per H. Lundow_