|
Search: id:A003772
|
|
|
| A003772 |
|
Number of Hamiltonian paths in K_4 X P_n. |
|
+0
1
|
|
| 12, 408, 6648, 90672, 1103088, 12509256, 135409896, 1419480288, 14545113696, 146607233784, 1460033574744, 14411647534224, 141321405768144, 1379055205227432, 13408489143753672
(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
|
Faase gives a 6-term linear recurrence on his web page:
a(1) = 12,
a(2) = 408,
a(3) = 6648,
a(4) = 90672,
a(5) = 1103088,
a(6) = 12509256,
a(7) = 135409896 and
a(n) = 23a(n-1) - 173a(n-2) + 421a(n-3) + 62a(n-4) - 132a(n-5) + 24a(n-6).
|
|
CROSSREFS
|
Sequence in context: A024298 A081021 A138914 this_sequence A098602 A000897 A036687
Adjacent sequences: A003769 A003770 A003771 this_sequence A003773 A003774 A003775
|
|
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
|
