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

%I A028474
%S A028474 1,233,2131,145601,2332097,106912793,2188978117,82741005829,
%T A028474 1937528668711,65743732590821,1666961188795475,53060477521960000,
%U A028474 1412218550274852671,43242613716069407953,1185802123987680144427
%N A028474 Number of perfect matchings in graph P_{12} X P_{n}.
%D A028474 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 A028474 Per Hakan Lundow, <a href="http://www.theophys.kth.se/~phl/Text/1factors2.ps.gz">
               Enumeration of matchings in polygraphs</a>, 1998.
%Y A028474 Row 12 of array A099390.
%Y A028474 Sequence in context: A108820 A003537 A037033 this_sequence A101218 A036209 
               A077803
%Y A028474 Adjacent sequences: A028471 A028472 A028473 this_sequence A028475 A028476 
               A028477
%K A028474 nonn
%O A028474 1,2
%A A028474 Per Hakan Lundow (phl(AT)theophys.kth.se)

Search completed in 0.001 seconds