cp's OEIS Frontend

A003685 Number of Hamiltonian paths in P_3 X P_n.

%I A003685 #26 Feb 10 2020 12:33:04
%S A003685 1,8,20,62,132,336,688,1578,3190,6902,13878,29038,58238,119518,239390,
%T A003685 485822,972414,1960830,3923326,7882494,15768574,31616510,63240702,
%U A003685 126655486,253327358,507033598,1014102014,2029023230,4058120190,8118001662,16236158974,32476086270
%N A003685 Number of Hamiltonian paths in P_3 X P_n.
%D A003685 F. Faase, On the number of specific spanning subgraphs of the graphs G X P_n, Ars Combin. 49 (1998), 129-154.
%H A003685 Andrew Howroyd, <a href="/A003685/b003685.txt">Table of n, a(n) for n = 1..500</a>
%H A003685 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 A003685 F. Faase, <a href="http://www.iwriteiam.nl/counting.html">Counting Hamiltonian cycles in product graphs</a>
%H A003685 F. Faase, <a href="http://www.iwriteiam.nl/Cresults.html">Results from the counting program</a>
%H A003685 A. Kloczkowski, and R. L. Jernigan, <a href="https://doi.org/10.1063/1.477128">Transfer matrix method for enumeration and generation of compact self-avoiding walks. I. Square lattices</a>, The Journal of Chemical Physics 109, 5134 (1998); doi: 10.1063/1.477128.
%F A003685 a(n) = 3*a(n-1) + 2*a(n-2) - 12*a(n-3) + 4*a(n-4) + 12*a(n-5) - 8*a(n-6), n>8.
%F A003685 From _David Bevan_, Jul 21 2006: (Start)
%F A003685 a(2*m) = 121*2^(2*m-4) - 4*m*2^m - 25*2^(m-2) - 2, m > 1.
%F A003685 a(2*m+1) = 121*2^(2*m-3) - 31*m*2^(m-2) - 23*2^(m-1) - 2, m > 0.
%F A003685 a(n) = 8*a(n-2) - 20*a(n-4) + 16*a(n-6) + 6, n > 8. (End)
%F A003685 O.g.f.: (2*x^7-8*x^6+12*x^5-2*x^4-2*x^3-6*x^2+5*x+1)*x/((2*x-1)*(-1+2*x^2)^2*(-1+x)). - _R. J. Mathar_, Dec 05 2007
%Y A003685 Row n=3 of A332307.
%K A003685 nonn
%O A003685 1,2
%A A003685 _Frans J. Faase_
%E A003685 Terms a(29) and beyond from _Andrew Howroyd_, Feb 10 2020