%I A028485
%S A028485 2,845,20172,2289869,97964230,7649951296,405583759128,
%T A028485 27499952912185,1591141858520618,101905561228130549,
%U A028485 6113307278736517860,382470784319563068389,23290532695631115845632
%N A028485 Number of perfect matchings in graph C_{14} X P_{n}.
%D A028485 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 A028485 Per Hakan Lundow, <a href="http://www.theophys.kth.se/~phl/Text/1factors2.ps.gz">
               Enumeration of matchings in polygraphs</a>, 1998.
%Y A028485 Sequence in context: A078169 A109555 A013537 this_sequence A034227 A145748 
               A141185
%Y A028485 Adjacent sequences: A028482 A028483 A028484 this_sequence A028486 A028487 
               A028488
%K A028485 nonn
%O A028485 1,1
%A A028485 Per Hakan Lundow (phl(AT)theophys.kth.se)