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

%I A028446
%S A028446 9,5051532105
%N A028446 Number of perfect matchings in graph P_{2n} X P_{2n} X P_{2n}.
%D A028446 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 A028446 Per Hakan Lundow, <a href="http://www.theophys.kth.se/~phl/Text/1factors2.ps.gz">
               Enumeration of matchings in polygraphs</a>, 1998.
%Y A028446 Sequence in context: A131678 A029983 A154110 this_sequence A058470 A058434 
               A067487
%Y A028446 Adjacent sequences: A028443 A028444 A028445 this_sequence A028447 A028448 
               A028449
%K A028446 nonn,bref,more
%O A028446 1,1
%A A028446 Per Hakan Lundow (phl(AT)theophys.kth.se)

Search completed in 0.001 seconds