|
|
A137308
|
|
Number of dimer coverings on n X n square if n is even; number of dimer arrangements with exactly one monomer if n is odd.
|
|
2
|
|
|
1, 1, 2, 18, 36, 2180, 6728, 2200776, 12988816, 20355006224, 258584046368, 1801272981919008, 53060477521960000, 1560858753560238398528, 112202208776036178000000, 13428038397958481723104394368
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,3
|
|
COMMENTS
|
Subsequence of even-subscripted terms is A004003.
Also the number of maximum matchings in the n X n grid graph. - Eric W. Weisstein, May 28 2017
|
|
REFERENCES
|
Y. Kong, Packing dimers on (2p+1) X (2q+1) lattices, Phys. Rev. E 73 (2006) 016106
|
|
LINKS
|
Eric Weisstein's World of Mathematics, Matching
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|