

A003771


Number of Hamiltonian cycles in K_4 X P_n.


1



3, 30, 198, 1326, 8886, 59550, 399078, 2674446, 17922966, 120111870, 804937158, 5394336366, 36150480246, 242264688990, 1623551862438, 10880333659086, 72915231888726, 488645955902910, 3274691227542918
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,1


REFERENCES

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


LINKS

Table of n, a(n) for n=1..19.
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), 129154.
F. Faase, Counting Hamiltonian cycles in product graphs
F. Faase, Results from the counting program


FORMULA

a(n) = 7a(n1)  2a(n2), n>3.
G.f.: 3x(1+3x2x^2)/(17x+2x^2). [From R. J. Mathar, Dec 16 2008]


CROSSREFS

Sequence in context: A177727 A132413 A032263 * A121100 A203366 A130546
Adjacent sequences: A003768 A003769 A003770 * A003772 A003773 A003774


KEYWORD

nonn,easy


AUTHOR

Frans J. Faase


STATUS

approved



