|
| |
|
|
A003735
|
|
Number of perfect matchings (or domino tilings) in W_5 X P_2n.
|
|
0
| |
|
|
29, 1189, 49401, 2053641, 85373589, 3549138989, 147544320241, 6133692298001, 254989017189389, 10600368542888629, 440677071050573801, 18319766917914642201
(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) = 44a(n-1) - 102a(n-2) + 44a(n-3) - a(n-4), n>4.
|
|
|
CROSSREFS
| Sequence in context: A138660 A176695 A025761 * A159479 A195740 A139192
Adjacent sequences: A003732 A003733 A003734 * A003736 A003737 A003738
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Frans Faase (Frans_LiXia(AT)wxs.nl)
|
| |
|
|
