Search: id:A028487
Results 1-1 of 1 results found.

%I A028487
%S A028487 2,2209,75272,18241441,1227006722,188926707649,16603641077888,
%T A028487 2122419930133441,210276188553004802,24741567816392584609,
%U A028487 2589989855253457012232,293455063685003452121761
%N A028487 Number of perfect matchings in graph C_{16} X P_{n}.
%D A028487 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 A028487 Per Hakan Lundow, <a href="http://www.theophys.kth.se/~phl/Text/1factors2.ps.gz">
               Enumeration of matchings in polygraphs</a>, 1998.
%Y A028487 Sequence in context: A004908 A004813 A089981 this_sequence A073476 A051103 
               A005800
%Y A028487 Adjacent sequences: A028484 A028485 A028486 this_sequence A028488 A028489 
               A028490
%K A028487 nonn
%O A028487 1,1
%A A028487 Per Hakan Lundow (phl(AT)theophys.kth.se)

Search completed in 0.001 seconds