|
| |
|
|
A003747
|
|
Number of perfect matchings (or domino tilings) in K_5 X P_2n.
|
|
0
| |
|
|
56, 4181, 313501, 23508376, 1762814681, 132187592681, 9912306636376, 743290810135501, 55736898453526181, 4179524093204328056, 313408570091871078001
(list; graph; refs; listen; history; internal format)
|
|
|
|
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
| a(n) = 76a(n-1) - 76a(n-2) + a(n-3), n>3.
|
|
|
CROSSREFS
| Sequence in context: A199709 A205227 A042513 * A049033 A009600 A202565
Adjacent sequences: A003744 A003745 A003746 * A003748 A003749 A003750
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Frans Faase (Frans_LiXia(AT)wxs.nl)
|
| |
|
|
