|
|
A295214
|
|
Array T(m,n) read by antidiagonals: number of m X n rectangular patterns of precisely half black squares and half white squares that are tilable with black and white colored dominoes, for m >= 1, n >= 1.
|
|
3
|
|
|
0, 2, 2, 0, 6, 0, 4, 16, 16, 4, 0, 44, 0, 44, 0, 8, 120, 318, 318, 120, 8, 0, 328, 0, 2798, 0, 328, 0, 16, 896, 6334, 22222, 22222, 6334, 896, 16
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
See links.
|
|
LINKS
|
|
|
FORMULA
|
|
|
EXAMPLE
|
Upper left corner of array:
0, 2, 0, 4, 0, ...
2, 6, 16, 44, ...
0, 16, 0, ...
4, 44, ...
0, ...
...
|
|
CROSSREFS
|
Cf. A295215 (unambiguously tilable patterns), A295216 (ambiguously tilable patterns), A004003 (domino tiling of a square), A099390 (domino tiling of a rectangle).
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|