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

%I A028457
%S A028457 11,722,29213,1347920,60155908,2711547333,121926974411,
%T A028457 5486824130234,246868369783200,11108030731300009,499808090143585644,
%U A028457 22489082779271197033,1011905249122931313347,45531100591422826963680
%N A028457 Number of perfect matchings in graph P_{2} X C_{5} X P_{n}.
%D A028457 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 A028457 Per Hakan Lundow, <a href="http://www.theophys.kth.se/~phl/Text/1factors2.ps.gz">
               Enumeration of matchings in polygraphs</a>, 1998.
%Y A028457 Sequence in context: A142738 A115737 A036933 this_sequence A110776 A058392 
               A100369
%Y A028457 Adjacent sequences: A028454 A028455 A028456 this_sequence A028458 A028459 
               A028460
%K A028457 nonn
%O A028457 1,1
%A A028457 Per Hakan Lundow (phl(AT)theophys.kth.se)

Search completed in 0.001 seconds