Triangle read by rows: T(n,k) is the maximum number of ways in which a set of integer-sided squares can tile an n X k rectangle, up to rotations and reflections, 0 <= k <= n.
A362258
Triangle read by rows: T(n,k) is the maximum number of ways in which a set of integer-sided squares can tile an n X k rectangle, up to rotations and reflections, 0 <= k <= n.
Terms
- a(0) =1a(1) =1a(2) =1a(3) =1a(4) =1a(5) =1a(6) =1a(7) =1a(8) =1a(9) =1a(10) =1a(11) =1a(12) =2a(13) =2a(14) =4a(15) =1a(16) =1a(17) =2a(18) =4a(19) =13a(20) =20a(21) =1a(22) =1a(23) =4a(24) =8a(25) =33a(26) =125a(27) =277a(28) =1a(29) =1
External references
- oeis: A362258