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, 0 <= k <= n.

A362142

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, 0 <= k <= n.

Terms

    a(0) =1a(1) =1a(2) =1a(3) =1a(4) =1a(5) =1a(6) =1a(7) =1a(8) =2a(9) =4a(10) =1a(11) =1a(12) =3a(13) =6a(14) =16a(15) =1a(16) =1a(17) =4a(18) =12a(19) =37a(20) =140a(21) =1a(22) =1a(23) =6a(24) =24a(25) =105a(26) =454a(27) =1987a(28) =1a(29) =1

External references