Triangle read by rows: T(n,k) is the maximum number of ways in which a set of integer-sided rectangular pieces can tile an n X k rectangle, up to rotations and reflections.
A361221
Triangle read by rows: T(n,k) is the maximum number of ways in which a set of integer-sided rectangular pieces can tile an n X k rectangle, up to rotations and reflections.
Terms
- a(0) =1a(1) =1a(2) =1a(3) =1a(4) =5a(5) =8a(6) =2a(7) =12a(8) =95a(9) =719a(10) =2a(11) =31a(12) =682a(13) =20600a(14) =315107
External references
- oeis: A361221