|
Search: id:A003752
|
|
|
| A003752 |
|
Number of Hamiltonian paths in C_4 X P_n. |
|
+0
1
|
|
| 4, 72, 584, 4016, 24656, 140624, 761960, 3976704, 20173280, 100097008, 488003448, 2345542720, 11142878992, 52426883056, 244682331976, 1134222633280, 5227498311360, 23975219772016, 109500177006104
(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(1) = 4,
a(2) = 72,
a(3) = 584,
a(4) = 4016,
a(5) = 24656,
a(6) = 140624,
a(7) = 761960,
a(8) = 3976704 and
a(n) = 11a(n-1) - 36a(n-2) + 16a(n-3) + 67a(n-4) - 9a(n-5) - 10a(n-6) + 2a(n-7).
|
|
CROSSREFS
|
Sequence in context: A077112 A095385 A071683 this_sequence A062018 A119580 A139745
Adjacent sequences: A003749 A003750 A003751 this_sequence A003753 A003754 A003755
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Frans Faase (Frans_LiXia(AT)wxs.nl)
|
|
EXTENSIONS
|
Added recurrence from Faase's web page. - N. J. A. Sloane (njas(AT)research.att.com), Feb 03 2009
|
|
|
Search completed in 0.002 seconds
|
