Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #14 Dec 09 2013 19:18:20
%S 1,444,440693,471163403,508635101004,549900748355911,
%T 594654671638397671,643075325593489894332,695442956730066504782459,
%U 752075788532628446524005125,813320598084518693275523115756,879552861931742201382115765976449,951178713466776585241143064515946177
%N Number of perfect matchings in graph P_{3} X C_{3} 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 Alois P. Heinz, <a href="/A028460/b028460.txt">Table of n, a(n) for n = 0..300</a>
%H Alois P. Heinz, <a href="/A028460/a028460.txt">G.f. for A028460</a>
%H Per Hakan Lundow, <a href="http://www.theophys.kth.se/~phl/Text/1factors2.ps.gz">Enumeration of matchings in polygraphs</a>, 1998.
%F G.f.: see link above.
%K nonn
%O 0,2
%A _Per H. Lundow_