%I #15 Mar 15 2024 10:11:17
%S 0,1080,164592,20396448,2428320384,286823607552,33827383254528,
%T 3988426882116096,470233321659859968,55439769483965159424,
%U 6536251970145879588864,770612494232908324306944,90853840060892585296330752,10711505792163773008895901696
%N Number of spanning trees with degrees 1 and 3 in S_5 X P_{4n+2}.
%H F. Faase, <a href="http://www.iwriteiam.nl/counting.html">Counting Hamiltonian cycles in product graphs</a>
%H <a href="/index/Rec#order_04">Index entries for linear recurrences with constant coefficients</a>, signature (154,-4584,38664,-3888).
%F a(n) = +154*a(n-1) -4584*a(n-2) +38664*a(n-3) -3888*a(n-4).
%F G.f.: -216*x^2*(8*x-5)/((18*x-1)^2*(12*x^2-118*x+1)). [_Colin Barker_, Sep 08 2012]
%K nonn,easy
%O 1,2
%A _Ralf Stephan_, Mar 28 2004