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.

A361216

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.

Terms

    a(0) =1a(1) =1a(2) =4a(3) =2a(4) =11a(5) =56a(6) =3a(7) =29a(8) =370a(9) =5752a(10) =4a(11) =94a(12) =2666a(13) =82310a(14) =2519124a(15) =6a(16) =263a(17) =19126a(18) =1232770a(19) =88117873a(20) =6126859968a(21) =12a(22) =968a(23) =134902a(24) =19119198a(25) =2835424200

External references