Maximum number of ways in which a set of integer-sided rectangular pieces can tile an n X 3 rectangle.
A361219
Maximum number of ways in which a set of integer-sided rectangular pieces can tile an n X 3 rectangle.
Terms
- a(0) =2a(1) =11a(2) =56a(3) =370a(4) =2666a(5) =19126a(6) =134902a(7) =1026667a(8) =8049132a(9) =60996816a(10) =450456500a(11) =3427769018a(12) =27127841200a(13) =211563038980
External references
- oeis: A361219