|
%I #15 Jan 01 2019 06:31:05
%S 1,10,46,238,1170,5882,29278,146382,730434,3647994,18212046,90936494,
%T 454029874,2266968122,11318785790,56514147406,282171551586,
%U 1408866513082,7034386262766,35122279177902
%N Number of Hamiltonian cycles in W_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(1) = 1,
%F a(2) = 10,
%F a(3) = 46,
%F a(4) = 238,
%F a(5) = 1170,
%F a(6) = 5882 and
%F a(n) = 5a(n-1) + 3a(n-2) - 19a(n-3) + 20a(n-4) - 4a(n-5).
%F G.f.: x(1+5x-7x^2-3x^3+12x^4-4x^5)/(1-5x-3x^2+19x^3-20x^4+4x^5). [From _R. J. Mathar_, Dec 16 2008]
%K nonn
%O 1,2
%A _Frans J. Faase_
%E Added recurrence from Faase's web page. - _N. J. A. Sloane_, Feb 03 2009
|
