Maximum number of ways in which a set of integer-sided rectangular pieces can tile an n X n square.
A361217
Maximum number of ways in which a set of integer-sided rectangular pieces can tile an n X n square.
Terms
- a(0) =1a(1) =4a(2) =56a(3) =5752a(4) =2519124a(5) =6126859968
External references
- oeis: A361217