|
Search: id:A003771
|
|
|
| A003771 |
|
Number of Hamilton cycles in K_4 X P_n. |
|
+0
1
|
|
| 3, 30, 198, 1326, 8886, 59550, 399078, 2674446, 17922966, 120111870, 804937158, 5394336366, 36150480246, 242264688990, 1623551862438, 10880333659086, 72915231888726, 488645955902910, 3274691227542918
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
REFERENCES
|
F. Faase, On the number of specific spanning subgraphs of the graphs G X P_n, Ars Combin. 49 (1998), 129-154.
|
|
LINKS
|
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 Hamilton cycles in product graphs
F. Faase, Results from the counting program
F. Faase, Counting Hamilton cycles in product graphs
|
|
FORMULA
|
a(n) = 7a(n-1) - 2a(n-2), n>3.
G.f.: 3x(1+3x-2x^2)/(1-7x+2x^2). [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Dec 16 2008]
|
|
CROSSREFS
|
Sequence in context: A013220 A132413 A032263 this_sequence A121100 A130546 A051133
Adjacent sequences: A003768 A003769 A003770 this_sequence A003772 A003773 A003774
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Frans Faase (Frans_LiXia(AT)wxs.nl)
|
|
|
Search completed in 0.002 seconds
|
