OFFSET
0,13
LINKS
Alois P. Heinz, Table of n, a(n) for n = 0..350
Liang Kai, Solving tiling enumeration problems by tensor network contractions, arXiv:2503.17698 [math.CO], 2025.
Wikipedia, Domino (mathematics)
Wikipedia, Tromino
FORMULA
A(n,k) = A(k,n).
EXAMPLE
A(3,2) = A(2,3) = 6:
.___. .___. .___. .___. .___. .___.
| | | |___| | | | |___| | ._| |_. |
| | | |___| |_|_| | | | |_| | | |_|
|_|_| |___| |___| |_|_| |___| |___| .
.
Square array A(n,k) begins:
1, 1, 1, 1, 1, 1, 1, 1, ...
1, 0, 1, 1, 1, 2, 2, 3, ...
1, 1, 2, 6, 17, 43, 108, 280, ...
1, 1, 6, 30, 145, 733, 3540, 17300, ...
1, 1, 17, 145, 1352, 12688, 115958, 1075397, ...
1, 2, 43, 733, 12688, 226922, 3927233, 68846551, ...
1, 2, 108, 3540, 115958, 3927233, 128441094, 4263997124, ...
1, 3, 280, 17300, 1075397, 68846551, 4263997124, 267855152858, ...
CROSSREFS
KEYWORD
nonn,tabl
AUTHOR
Alois P. Heinz, Jul 25 2023
EXTENSIONS
Terms n,k>=4 had to be corrected as was pointed out by Martin Fuller and David Radcliffe - Alois P. Heinz, Apr 05 2025
STATUS
approved
