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

0, 2, 2, 0, 4, 0, 4, 10, 10, 4, 0, 22, 0, 22, 0, 8, 50, 144, 144, 50, 8, 0, 114, 0, 864, 0, 114, 0, 16, 258, 1924, 5354, 5354, 1924, 258, 16

Offset

1,2

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 unambiguously decomposable patterns

Example

Upper left corner of array:
0,  2,  0,  4,  0, ...
2,  4, 10, 22, ...
0, 10,  0, ...
4, 22, ...
0, ...
...

Crossrefs

Cf. A295214 for all tilable patterns, A295216 for ambiguously tilable patterns, A099390 for domino tiling of a rectangle.

Sequence in context: A378982 A138476 A131381 * A112080 A052176 A138092

Adjacent sequences: A295212 A295213 A295214 * A295216 A295217 A295218

Keyword

nonn,tabl,more

Author

John Mason, Nov 17 2017

Status

approved