|
Search: id:A003741
|
|
|
| A003741 |
|
Number of perfect matchings (or domino tilings) in O_5 X P_2n. |
|
+0
1
|
|
| 40, 2197, 121735, 6748096, 374079619, 20737143595, 1149566489968, 63726386332735, 3532681575875629, 195834721732832344, 10856126548559080585, 601810968956118729913
(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
Index entries for sequences related to dominoes
|
|
FORMULA
|
If b(n) denotes the number of perfect matchings (or domino tilings) in O_5 X P_n we have:
b(1) = 0,
b(2) = 40,
b(3) = 0,
b(4) = 2197,
b(5) = 0,
b(6) = 121735,
b(7) = 0,
b(8) = 6748096,
b(9) = 0,
b(10) = 374079619,
b(11) = 0,
b(12) = 20737143595, and
b(n) = 65b(n-2) - 548b(n-4) + 995b(n-6) - 548b(n-8) + 65b(n-10) - b(n-12).
|
|
CROSSREFS
|
Sequence in context: A143314 A060056 A140729 this_sequence A049215 A059948 A045502
Adjacent sequences: A003738 A003739 A003740 this_sequence A003742 A003743 A003744
|
|
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
|
