|
Search: id:A003769
|
|
|
| A003769 |
|
Number of perfect matchings (or domino tilings) in K_4 X P_n. |
|
+0
4
|
|
| 3, 16, 75, 361, 1728, 8281, 39675, 190096, 910803, 4363921, 20908800, 100180081, 479991603, 2299777936, 11018898075, 52794712441, 252954664128, 1211978608201, 5806938376875, 27822713276176
(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
|
a(n) = 4a(n-1) + 4a(n-2) - a(n-3), n>3.
(1/7) [6*A030221(n) - A054477(n) + 2(-1)^n].
G.f.: x(3+4x-x^2)/((1+x)(1-5x+x^2)). [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Dec 16 2008]
|
|
CROSSREFS
|
Essentially the same as A005386. First differences of A099025.
Sequence in context: A038602 A004303 A005947 this_sequence A005386 A053572 A055842
Adjacent sequences: A003766 A003767 A003768 this_sequence A003770 A003771 A003772
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Frans Faase (Frans_LiXia(AT)wxs.nl)
|
|
|
Search completed in 0.005 seconds
|
