%I #19 May 20 2017 21:47:42
%S 1,1,108,49793133,17312701462385916505,
%T 463310369790129032480118384076035223552
%N Number of matchings in graph P_{n} X P_{n} X P_{n}.
%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 reports, No 12, 1996, Department of Mathematics, Umea University.
%H Per Hakan Lundow, <a href="http://www.theophys.kth.se/~phl/Text/1factors2.ps.gz">Enumeration of matchings in polygraphs</a>, 1998.
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/GridGraph.html">Grid Graph</a>
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/IndependentEdgeSet.html">Independent Edge Set</a>
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/Matching.html">Matching</a>
%K nonn,more
%O 0,3
%A _Per H. Lundow_