%I A033532
%S A033532 41025,13803794944,3952450882750401,1149377449671217283137,
%T A033532 333818434084936656186187776,96963347585045688551801772350785,
%U A033532 28164412862777096850129871275625835649
%N A033532 Number of matchings in graph C_{4} X C_{4} X P_{n}
%C A033532 a(0)=A045310(3), a(1)=A045310(4).
%D A033532 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 A033532 Per Hakan Lundow, <a href="http://www.theophys.kth.se/~phl/Text/1factors2.ps.gz">
               Enumeration of matchings in polygraphs</a>, 1998.
%Y A033532 Sequence in context: A164648 A097479 A133863 this_sequence A047828 A141711 
               A074379
%Y A033532 Adjacent sequences: A033529 A033530 A033531 this_sequence A033533 A033534 
               A033535
%K A033532 nonn
%O A033532 0,1
%A A033532 Per Hakan Lundow (phl(AT)theophys.kth.se)