|
%I #7 Dec 09 2013 19:24:34
%S 1,121,155969,127027769,114249681408,101177745416793,
%T 89966299634302561,79958827951928352569,71078263639970542379841,
%U 63183478420387429145703424,56166200950909879145980135745,49928308269466147536604718385017,44383238038596676487837495423842529
%N Number of perfect matchings in graph P_{4} X C_{4} X P_{n}.
%D Per Hakan Lundow, "Computation of matching polynomials and the number of 1-factors in polygraphs", 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.
%K nonn
%O 0,2
%A _Per H. Lundow_
%E More terms from _Alois P. Heinz_, Dec 09 2013
|
