|
%I
%S 1,71,21497,5493583,1441534384,376940962215,98618371821449,
%T 25799240154157639,6749345823947488233,1765694380951147363456,
%U 461922949276035424430681,120843562204869252316712655,31613858308925485200467329841,8270494656919429771594190182151
%N Number of matchings in graph P_{2} X P_{4} X P_{n}.
%D Per Hakan Lundow, "Computation of matching polynomials and the number of 1-factors in polygraphs", Research reports, No 12, 1996, Department of Mathematics, Umea University.
%H Alois P. Heinz, <a href="/A033527/b033527.txt">Table of n, a(n) for n = 0..200</a>
%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
%O 0,2
%A _Per H. Lundow_
|
