%I A028486
%S A028486 1364,6323504,35269184041,207171729355756,1240837214254999769,
%T A028486 7491895591984935317759,45390122553039546330628096,
%U A028486 275408624219475075609746445361,1672150595320335623747680596071399
%N A028486 Number of perfect matchings in graph C_{15} X P_{2n}.
%D A028486 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 A028486 Per Hakan Lundow, <a href="http://www.theophys.kth.se/~phl/Text/1factors2.ps.gz">
               Enumeration of matchings in polygraphs</a>, 1998.
%Y A028486 Sequence in context: A119521 A004930 A004950 this_sequence A013592 A152942 
               A043686
%Y A028486 Adjacent sequences: A028483 A028484 A028485 this_sequence A028487 A028488 
               A028489
%K A028486 nonn
%O A028486 1,1
%A A028486 Per Hakan Lundow (phl(AT)theophys.kth.se)