|
%I #15 Mar 08 2016 12:43:07
%S 1,144,251498,293066688,370635224561,461148537211748,
%T 575975678462394151,718704019165239462736,897032469743945346623442,
%U 1119528305492897225312120742,1397239543795157686038029989037,1743829823240164494694386437970640
%N Number of matchings in graph P_{11} 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="/A033514/b033514.txt">Table of n, a(n) for n = 0..300</a>
%H Per Hakan Lundow, <a href="http://www.theophys.kth.se/~phl/Text/1factors2.ps.gz">Enumeration of matchings in polygraphs</a>, 1998.
%Y Column k=11 of A210662.
%K nonn
%O 0,2
%A _Per H. Lundow_
|
