A219946
Number A(n,k) of tilings of a k X n rectangle using right trominoes and 2 X 2 tiles; square array A(n,k), n>=0, k>=0, read by antidiagonals.
Original entry on oeis.org
1, 1, 1, 1, 0, 1, 1, 0, 0, 1, 1, 0, 1, 0, 1, 1, 0, 2, 2, 0, 1, 1, 0, 1, 0, 1, 0, 1, 1, 0, 4, 4, 4, 4, 0, 1, 1, 0, 5, 0, 6, 0, 5, 0, 1, 1, 0, 6, 8, 16, 16, 8, 6, 0, 1, 1, 0, 13, 0, 37, 0, 37, 0, 13, 0, 1, 1, 0, 16, 16, 92, 136, 136, 92, 16, 16, 0, 1, 1, 0, 25, 0, 245, 0, 545, 0, 245, 0, 25, 0, 1
Offset: 0
A(4,4) = 6, because there are 6 tilings of a 4 X 4 rectangle using right trominoes and 2 X 2 tiles:
.___.___. .___.___. .___.___. .___.___. .___.___. .___.___.
| . | . | | ._|_. | | ._| . | | ._|_. | | ._|_. | | . |_. |
|___|___| |_| . |_| |_| |___| |_| ._|_| |_|_. |_| |___| |_|
| . | . | | |___| | | |___| | | |_| . | | . |_| | | |___| |
|___|___| |___|___| |___|___| |___|___| |___|___| |___|___|
Square array A(n,k) begins:
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, ...
1, 0, 0, 0, 0, 0, 0, 0, 0, 0, ...
1, 0, 1, 2, 1, 4, 5, 6, 13, 16, ...
1, 0, 2, 0, 4, 0, 8, 0, 16, 0, ...
1, 0, 1, 4, 6, 16, 37, 92, 245, 560, ...
1, 0, 4, 0, 16, 0, 136, 0, 1128, 384, ...
1, 0, 5, 8, 37, 136, 545, 2376, 10534, 46824, ...
1, 0, 6, 0, 92, 0, 2376, 5504, 71248, 253952, ...
1, 0, 13, 16, 245, 1128, 10534, 71248, 652036, 5141408, ...
1, 0, 16, 0, 560, 384, 46824, 253952, 5141408, 44013568, ...
Columns (or rows) k=0-10 give:
A000012,
A000007,
A052947,
A077957,
A165799,
A190759,
A219947,
A219948,
A219949,
A219950,
A219951.
-
b:= proc(n, l) option remember; local k, t;
if max(l[])>n then 0 elif n=0 or l=[] then 1
elif min(l[])>0 then t:=min(l[]); b(n-t, map(h->h-t, l))
else for k do if l[k]=0 then break fi od;
`if`(k>1 and l[k-1]=1, b(n, subsop(k=2, k-1=2, l)), 0)+
`if`(k `if`(n>=k, b(n, [0$k]), b(k, [0$n])):
seq(seq(A(n, d-n), n=0..d), d=0..14);
-
b[n_, l_] := b[n, l] = Module[{k, t}, If[Max[l] > n , 0 , If [n == 0 || l == {},1 , If[Min[l] > 0, t = Min[l]; b[n-t, l-t], For[k = 1, k <= Length[l], k++, If[l[[k]] == 0 , Break[]]]; If[k > 1 && l[[k-1]] == 1, b[n, ReplacePart[l, {k -> 2, k-1 -> 2}]], 0] + If[k < Length[l] && l[[k+1]] == 1, b[n, ReplacePart[l, {k -> 2, k+1 -> 2}]], 0] + If[k < Length[l] && l[[k+1]] == 0, b[n, ReplacePart[l, {k -> 2, k+1 -> 2}]] + b[n, ReplacePart[l, {k -> 1, k+1 -> 2}]] + b[n, ReplacePart[l, {k -> 2, k+1 -> 1}]], 0]+If[k+1 < Length[l] && l[[k+1]] == 0 && l[[k+2]] == 0, b[n, ReplacePart[l, {k -> 2, k+1 -> 2, k+2 -> 2}]], 0]]]]]; a[n_, ] := If[n >= k, b[n, Array[0&, k]], b[k, Array[0&, n]]]; Table[Table[a[n, d-n], {n, 0, d}], {d, 0, 14}] // Flatten (* _Jean-François Alcover, Nov 26 2013, translated from Alois P. Heinz's Maple program *)
A233807
Number of tilings of an n X n square using right trominoes and at most one monomino.
Original entry on oeis.org
1, 1, 4, 0, 16, 128, 162, 34528, 943096, 1193600, 3525377600, 480585761344, 2033502499954, 46983507796973152, 32908187880881958736, 458324092996867592192, 83153202122213272708832688, 299769486068040749617049301344
Offset: 0
a(2) = 4:
.___. .___. .___. .___.
|_| | | |_| | ._| |_. |
|___| |___| |_|_| |_|_| .
-
b:= proc(n, w, l) option remember; local k, t;
if max(l[])>n then 0 elif n=0 then 1
elif min(l[])>0 then t:=min(l[]); b(n-t, w, map(h->h-t, l))
else for k while l[k]>0 do od;
`if`(w, b(n, false, s(k=1, l)), 0)+
`if`(k>1 and l[k-1]=1, b(n, w, s(k=2, k-1=2, l)), 0)+
`if`(k b(n, evalb(irem(n, 3)>0), [0$n]): s:= subsop:
seq(a(n), n=0..10);
-
$RecursionLimit = 1000; s = ReplacePart; b[n_, w_, l_] := b[n, w, l] = Module[{k, t}, Which[Max[l] > n, 0,n == 0, 1,Min[l] > 0, t = Min[l]; b[n-t, w, l-t], True, For[k = 1, l[[k]] > 0, k++ ]; If[w, b[n, False, s[l, k -> 1]], 0]+If[k > 1 && l[[k-1]] == 1, b[n, w, s[l, {k -> 2, k-1 -> 2}]], 0] + If[k < Length[l] && l[[k+1]] == 1, b[n, w, s[l, {k -> 2, k+1 -> 2}]], 0] + If[k < Length[l] && l[[k+1]] == 0, b[n, w, s[l, {k -> 1, k+1 -> 2}]]+b[n, w, s[l, {k -> 2, k+1 -> 1}]] + If[w, b[n, False, s[l, {k -> 2, k+1 -> 2}]], 0], 0] + If[k+1 < Length[l] && l[[k+1]] == 0 && l[[k+2]] == 0, b[n, w, s[l, {k -> 2, k+1 -> 2, k+2 -> 2}]], 0] ] ]; a[n_] := b[n, Mod[n, 3] > 0, Array[0 &, n]]; Table[Print[an = a[n]]; an, {n, 0, 16}] (* Jean-François Alcover, Dec 30 2013, translated from Maple *)
A353777
Number of tilings of an n X n square using dominoes, monominoes and 2 X 2 tiles.
Original entry on oeis.org
1, 1, 8, 163, 15623, 5684228, 8459468955, 50280716999785, 1202536689448371122, 115462301811597894998929, 44537596159273736617786474211, 69003082378039459280864860681919942, 429429579883061866326542598342441907826951, 10734684843612889640707750537898705644071715970757
Offset: 0
a(2) = 8:
.___. .___. .___. .___. .___. .___. .___. .___.
| | |_|_| |___| | | | |_|_| |___| |_| | | |_|
|___| |_|_| |___| |_|_| |___| |_|_| |_|_| |_|_| .
A353934
Number of tilings of an n X n square using right trominoes, dominoes, and monominoes.
Original entry on oeis.org
1, 1, 11, 369, 83374, 90916452, 546063639624, 17259079054003609, 2916019543694306398589, 2620143594924539083433405392, 12541344781693990981151732534871036, 319608708168951734031266758322647453517098, 43373075269161087186367095378869660507262626652634
Offset: 0
a(2) = 11:
.___. .___. .___. .___. .___. .___. .___. .___. .___. .___. .___.
|_|_| |___| | | | |_|_| |___| |_| | | |_| |_| | |_. | | ._| | |_|
|_|_| |___| |_|_| |___| |_|_| |_|_| |_|_| |___| |_|_| |_|_| |___| .
Cf.
A004003,
A028420,
A063443,
A219874,
A219952,
A219994,
A220061,
A220778,
A233807,
A270071,
A353777.
Showing 1-4 of 4 results.