

A361225


Maximum number of ways in which a set of integersided rectangular pieces can tile an n X 3 rectangle, up to rotations and reflections.


4




OFFSET

1,2


LINKS



EXAMPLE

The following table shows the sets of pieces that give the maximum number of tilings for n <= 7. The solutions are unique except for n = 1 and n = 3.
\ Number of pieces of size
n \ 1 X 1  1 X 2  1 X 3
+++
1  3  0  0
1  1  1  0
1  0  0  1
2  2  2  0
3  3  3  0
3  2  2  1
4  3  3  1
5  4  4  1
6  7  4  1
7  8  5  1
It seems that all optimal solutions for A361219 are also optimal here, but for n = 1 and n = 3 there are other optimal solutions.


CROSSREFS



KEYWORD

nonn,more


AUTHOR



STATUS

approved



