|
Search: id:A003698
|
|
|
| A003698 |
|
Number of 2-factors in C_4 X P_n. |
|
+0
1
|
|
| 1, 9, 53, 341, 2169, 13825, 88093, 561357, 3577121, 22794425, 145252485, 925589701, 5898117961, 37584466929, 239498796653, 1526153708861, 9725080775409, 61970950592425, 394896331045333, 2516390514947637
(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) = 6a(n-1) + 3a(n-2) - 4a(n-3), n>3.
|
|
CROSSREFS
|
Sequence in context: A122588 A005025 A038761 this_sequence A001688 A144040 A052108
Adjacent sequences: A003695 A003696 A003697 this_sequence A003699 A003700 A003701
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Frans Faase (Frans_LiXia(AT)wxs.nl)
|
|
|
Search completed in 0.002 seconds
|
