A003759 Number of Hamiltonian cycles in D_4 X P_n.

0, 2, 6, 24, 86, 320, 1176, 4340, 15994, 58970, 217388, 801426, 2954496, 10891960, 40153904, 148030026, 545722366, 2011841328, 7416784934, 27342464080, 100799786752, 371605023956, 1369946288898, 5050396829138

Offset

1,2

References

F. Faase, On the number of specific spanning subgraphs of the graphs G X P_n, Ars Combin. 49 (1998), 129-154.

Links

Table of n, a(n) for n=1..24.

F. Faase, On the number of specific spanning subgraphs of the graphs G X P_n, Preliminary version of paper that appeared in Ars Combin. 49 (1998), 129-154.

F. Faase, Counting Hamiltonian cycles in product graphs

F. Faase, Results from the counting program

Index entries for linear recurrences with constant coefficients, signature (3, 3, -2, 1).

Formula

a(n) = 3*a(n-1) + 3*a(n-2) - 2*a(n-3) + a(n-4), n>4.

G.f.: 2*x^2/(1-3*x-3x^2+2*x^3-x^4). - R. J. Mathar, Dec 16 2008

Crossrefs

Sequence in context: A002742 A048120 A322198 * A217527 A293774 A226037

Adjacent sequences: A003756 A003757 A003758 * A003760 A003761 A003762

Keyword

nonn

Author

Frans J. Faase, Mar 15 1996

Status

approved