%I #14 Jan 01 2019 06:31:05
%S 3,42,474,5514,63942,741786,8605014,99822138,1157982198,13433121114,
%T 155830324182,1807702748538,20970175374006,243263587212186,
%U 2821968429343638,32736119315989434
%N Number of 2-factors in K_4 X P_n.
%D F. Faase, On the number of specific spanning subgraphs of the graphs G X P_n, Ars Combin. 49 (1998), 129-154.
%H F. Faase, <a href="http://www.iwriteiam.nl/Cpaper.zip">On the number of specific spanning subgraphs of the graphs G X P_n</a>, Preliminary version of paper that appeared in Ars Combin. 49 (1998), 129-154.
%H F. Faase, <a href="http://www.iwriteiam.nl/counting.html">Counting Hamiltonian cycles in product graphs</a>
%H F. Faase, <a href="http://www.iwriteiam.nl/Cresults.html">Results from the counting program</a>
%F a(n) = 11a(n-1) + 8a(n-2) - 12a(n-3), n>3.
%F G.f.: 3x(4x+1)(1-x)/(1-11x-8x^2+12x^3). [From _R. J. Mathar_, Dec 16 2008]
%K nonn
%O 1,1
%A _Frans J. Faase_
|