|
%I #10 Dec 09 2013 23:24:18
%S 1,41025,13803794944,3952450882750401,1149377449671217283137,
%T 333818434084936656186187776,96963347585045688551801772350785,
%U 28164412862777096850129871275625835649,8180769830636914759269721968659872494731776,2376225290581931684771439975937521777947501317377
%N Number of matchings in graph C_{4} X C_{4} X P_{n}.
%C a(1) = A045310(4), a(2) = A045310(5).
%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 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_
%E a(8)-a(9) from _Alois P. Heinz_, Dec 09 2013
| 