

A295216


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 ambiguously tilable with black and white colored dominoes, for m >= 1, n >= 1.


3



0, 0, 0, 0, 2, 0, 0, 6, 6, 0, 0, 22, 0, 22, 0, 0, 70, 174, 174, 70, 0, 0, 214, 0, 1934, 0, 214, 0, 0, 638, 4410, 16868, 16868, 4410, 638, 0
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,5


COMMENTS

See links.


LINKS

Table of n, a(n) for n=1..36.
John Mason, A theorem about unambiguously decomposable rectangular patterns
John Mason, Examples of ambiguously decomposable patterns


EXAMPLE

Upper left corner of array:
0, 0, 0, 0, 0, ...
0, 2, 6, 22, ...
0, 6, 0, ...
0, 22, ...
0, ...
...


CROSSREFS

Cf. A295214 for all tilable patterns, A295215 for unambiguously tilable patterns, A099390 for domino tiling of a rectangle.
Sequence in context: A112964 A128613 A231063 * A230250 A137250 A329290
Adjacent sequences: A295213 A295214 A295215 * A295217 A295218 A295219


KEYWORD

nonn,tabl,more


AUTHOR

John Mason, Nov 17 2017


STATUS

approved



