%I #9 Dec 10 2013 09:56:12
%S 1,106784,56850678464,32898111133723321,19096119789145305208336,
%T 11085838411090123868197412129,6435670258948861016802884153464799,
%U 3736105167546089403361511734752297982336,2168924345573542197211153077794030841411079321
%N Number of perfect matchings in graph C_{3} X C_{5} X P_{2n}.
%D 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 Per Hakan Lundow, <a href="http://www.theophys.kth.se/~phl/Text/1factors2.ps.gz">Enumeration of matchings in polygraphs</a>, 1998.
%K nonn
%O 0,2
%A _Per H. Lundow_
%E a(8) from _Alois P. Heinz_, Dec 10 2013
|