|
Search: id:A003695
|
|
|
| A003695 |
|
Number of Hamiltonian paths in P_4 X P_n. |
|
+0
1
|
|
| 1, 14, 62, 276, 1006, 3610, 12010, 38984, 122188, 375122, 1128446, 3342794, 9767588, 28217820, 80709424, 228864620, 644060262, 1800346140, 5002457832, 13825549136, 38026348240, 104133664506, 284037629690
(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(1) = 1,
a(2) = 14,
a(3) = 62,
a(4) = 276,
a(5) = 1006,
a(6) = 3610,
a(7) = 12010,
a(8) = 38984,
a(9) = 122188,
a(10) = 375122,
a(11) = 1128446,
a(12) = 3342794,
a(13) = 9767588,
a(14) = 28217820,
a(15) = 80709424,
a(16) = 228864620 and
a(n) = 6a(n-1) - 5a(n-2) - 27a(n-3) + 37a(n-4) + 48a(n-5) - 69a(n-6) - 38a(n-7) + 57a(n-8) - 2a(n-9) - 31a(n-10) + 13a(n-11) + 3a(n-12) - 4a(n-13) + a(n-14).
|
|
CROSSREFS
|
Sequence in context: A140184 A025415 A125849 this_sequence A022674 A044152 A044533
Adjacent sequences: A003692 A003693 A003694 this_sequence A003696 A003697 A003698
|
|
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
|
