Counting Colorful Tilings of Rectangular Arrays
Kathryn Haymaker and Sara Robertson
Department of Mathematics and Statistics
St. Augustine Center 305
800 E. Lancaster Avenue
Villanova, PA 19085
In this paper we give recursive formulas for the number of colorful
tilings of small rectangular arrays. We enumerate the tilings of a 2 × n
board with painted squares, dominoes, and I-trominoes. We also provide
a recursion formula for the number of tilings of a 3 × n board with
colorful squares and dominoes. Finally, we describe a general method
for calculating the number of colorful tilings of an m × n
board with squares and dominoes.
Full version: pdf,
(Concerned with sequences
Received December 6 2016; revised version received April 11 2017.
Published in Journal of Integer Sequences, June 24 2017.
Journal of Integer Sequences home page