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

%I A037232
%S A037232 370,473888,545223468,633518934269,735463713700160,853881267896192137,
%T A037232 991358212180977707016,1150970019455064994111456,
%U A037232 1336279754744865935702007958,1551424939061435419705857645677
%N A037232 Number of matchings in graph C_{3} X C_{3} X P_{n}.
%D A037232 Per Hakan Lundow, "Computation of matching polynomials and the number 
               of 1-factors in polygraphs", Research reports, No 12, 1996, Department 
               of Mathematics, Umea University.
%H A037232 Per Hakan Lundow, <a href="http://www.theophys.kth.se/~phl/Text/1factors2.ps.gz">
               Enumeration of matchings in polygraphs</a>, 1998.
%Y A037232 Sequence in context: A108772 A161020 A102618 this_sequence A165330 A051182 
               A161362
%Y A037232 Adjacent sequences: A037229 A037230 A037231 this_sequence A037233 A037234 
               A037235
%K A037232 nonn
%O A037232 0,1
%A A037232 Per Hakan Lundow (phl(AT)theophys.kth.se)

Search completed in 0.001 seconds