|
Search: id:A003759
|
|
|
| A003759 |
|
Number of Hamilton cycles in D_4 X P_n. |
|
+0
1
|
|
| 0, 2, 6, 24, 86, 320, 1176, 4340, 15994, 58970, 217388, 801426, 2954496, 10891960, 40153904, 148030026, 545722366, 2011841328, 7416784934, 27342464080, 100799786752, 371605023956, 1369946288898, 5050396829138
(list; graph; listen)
|
|
|
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
|
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) = 3a(n-1) + 3a(n-2) - 2a(n-3) + a(n-4), n>4.
G.f.: 2x^2(1-3x-3x^2+2x^3-x^4). [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Dec 16 2008]
|
|
CROSSREFS
|
Sequence in context: A095110 A002742 A048120 this_sequence A003450 A115220 A072854
Adjacent sequences: A003756 A003757 A003758 this_sequence A003760 A003761 A003762
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Frans Faase (Frans_LiXia(AT)wxs.nl)
|
|
|
Search completed in 0.002 seconds
|
