OFFSET
0,5
LINKS
Kai Liang, Solving tiling enumeration problems by tensor network contractions, arXiv:2503.17698 [math.CO], 2025. See p. 25, Table 4.
EXAMPLE
a(4) = 6, because there are 6 tilings of a 4 X 4 square using right trominoes and 2 X 2 tiles:
.___.___. .___.___. .___.___. .___.___. .___.___. .___.___.
| . | . | | ._|_. | | ._| . | | ._|_. | | ._|_. | | . |_. |
|___|___| |_| . |_| |_| |___| |_| ._|_| |_|_. |_| |___| |_|
| . | . | | |___| | | |___| | | |_| . | | . |_| | | |___| |
|___|___| |___|___| |___|___| |___|___| |___|___| |___|___|
CROSSREFS
KEYWORD
nonn
AUTHOR
Alois P. Heinz, Dec 01 2012
EXTENSIONS
a(15)-a(16) from Alois P. Heinz, Sep 24 2014
a(17) from Alois P. Heinz, Nov 18 2018
STATUS
approved
