|
%I #17 Nov 22 2017 02:25:48
%S 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,
%T 0,0,638,4410,16868,16868,4410,638,0
%N 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.
%C See links.
%H John Mason, <a href="/A295215/a295215.pdf">A theorem about unambiguously decomposable rectangular patterns</a>
%H John Mason, <a href="/A295216/a295216_1.pdf">Examples of ambiguously decomposable patterns</a>
%e Upper left corner of array:
%e 0, 0, 0, 0, 0, ...
%e 0, 2, 6, 22, ...
%e 0, 6, 0, ...
%e 0, 22, ...
%e 0, ...
%e ...
%Y Cf. A295214 for all tilable patterns, A295215 for unambiguously tilable patterns, A099390 for domino tiling of a rectangle.
%K nonn,tabl,more
%O 1,5
%A _John Mason_, Nov 17 2017
|
