|
%I #10 May 25 2017 14:39:16
%S 1,322,1216380,3302453192,9457535113025,26888035021488624,
%T 76527499463086330097,217774999938555580092160,
%U 619738586975180574673477308,1763630522748154866449258489490,5018880864080352254319469089550521,14282562602209484999805202647488429632
%N Number of matchings in graph C_{12} X P_{n}.
%D 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 Per Hakan Lundow, <a href="http://www.theophys.kth.se/~phl/Text/1factors2.ps.gz">Enumeration of matchings in polygraphs</a>, 1998.
%Y Row 12 of A287428.
%K nonn
%O 0,2
%A _Per H. Lundow_
|
