|
| |
|
|
A145404
|
|
Number of perfect matchings (or domino tilings) in O_6 X P_n.
|
|
0
| |
|
|
8, 137, 2016, 30521, 459544, 6926545, 104379840, 1573019185, 23705440040, 357242140889, 5383654944672, 81131924020457, 1222661758446136, 18425567948435617, 277674141464763264, 4184561857758579553, 63061536262455564872, 950340200711850811433
(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
|
|
|
FORMULA
| For n>6, 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 * A101388 A050789 A187236
Adjacent sequences: A145401 A145402 A145403 * A145405 A145406 A145407
|
|
|
KEYWORD
| nonn,easy
|
|
|
AUTHOR
| N. J. A. Sloane (njas(AT)research.att.com), Feb 03 2009
|
|
|
EXTENSIONS
| More terms from Max Alekseyev (maxale(AT)gmail.com), Jun 24 2011
|
| |
|
|
