The OEIS is supported by the many generous donors to the OEIS Foundation.
%I #24 Apr 18 2021 17:48:08
%S 1,21,2356,196785,17525619,1539222016,135658637925,11945257052321,
%T 1052091957273408,92657526436631289,8160498611028648795,
%U 718704019165239462736,63297158846544276862187,5574656798624151746571203,490966794038702258639391536,43240039834820302340627322251
%N Number of matchings in graph P_{7} X P_{n}.
%H Andrew Howroyd, <a href="/A033510/b033510.txt">Table of n, a(n) for n = 0..200</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="/A033510/a033510.pdf">Generating function</a>, May 07 2013
%H Sergey Perepechko, <a href="/A033510/a033510.txt">Text version of generating function</a>
%Y Column 7 of triangle A210662.
%K nonn
%O 0,2
%A _Per H. Lundow_
%E Terms a(13) and beyond from _Andrew Howroyd_, Apr 18 2021