|
Search: id:A145404
|
|
|
| A145404 |
|
Number of perfect matchings (or domino tilings) in O_6 X P_n. |
|
+0
1
|
| |
|
|
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
|
|
FORMULA
|
Recurrence:
a(1) = 8,
a(2) = 137,
a(3) = 2016,
a(4) = 30521,
a(5) = 459544,
a(6) = 6926545, and
a(n) = 12a(n-1) + 47a(n-2) - 8a(n-3) - 47a(n-4) + 12a(n-5) + a(n-6).
|
|
CROSSREFS
|
Sequence in context: A024283 A134053 A136472 this_sequence A101388 A050789 A091060
Adjacent sequences: A145401 A145402 A145403 this_sequence A145405 A145406 A145407
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com), Feb 03 2009
|
|
|
Search completed in 0.002 seconds
|
