Counting colorful tilings of rectangular arrays
Journal of integer sequences, Tome 20 (2017) no. 5
In this paper we give recursive formulas for the number of colorful tilings of small rectangular arrays. We enumerate the tilings of a $2 \times n$ board with painted squares, dominoes, and I-trominoes. We also provide a recursion formula for the number of tilings of a $3 \times n$ board with colorful squares and dominoes. Finally, we describe a general method for calculating the number of colorful tilings of an $m \times n$ board with squares and dominoes.
@article{JIS_2017__20_5_a4,
author = {Haymaker, Kathryn and Robertson, Sara},
title = {Counting colorful tilings of rectangular arrays},
journal = {Journal of integer sequences},
year = {2017},
volume = {20},
number = {5},
zbl = {1365.05042},
language = {en},
url = {http://geodesic.mathdoc.fr/item/JIS_2017__20_5_a4/}
}
Haymaker, Kathryn; Robertson, Sara. Counting colorful tilings of rectangular arrays. Journal of integer sequences, Tome 20 (2017) no. 5. http://geodesic.mathdoc.fr/item/JIS_2017__20_5_a4/