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

%I A028479
%S A028479 2,49,392,5041,51842,591361,6422528,71385601,784792962,8672638129,
%T A028479 95605150088,1055154220849,11638893993218,128416422417409,
%U A028479 1416693454733312,15629912636083201,172434918695682818
%N A028479 Number of perfect matchings in graph C_{8} X P_{n}.
%D A028479 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 A028479 Per Hakan Lundow, <a href="http://www.theophys.kth.se/~phl/Text/1factors2.ps.gz">
               Enumeration of matchings in polygraphs</a>, 1998.
%Y A028479 Sequence in context: A058845 A041287 A057563 this_sequence A001568 A088067 
               A145676
%Y A028479 Adjacent sequences: A028476 A028477 A028478 this_sequence A028480 A028481 
               A028482
%K A028479 nonn
%O A028479 1,1
%A A028479 Per Hakan Lundow (phl(AT)theophys.kth.se)

Search completed in 0.001 seconds