Triangle read by rows: T(n,k) is the number of sets of integer-sided rectangular pieces that can tile an n X k rectangle, 1 <= k <= n.
A360629
Triangle read by rows: T(n,k) is the number of sets of integer-sided rectangular pieces that can tile an n X k rectangle, 1 <= k <= n.
Terms
- a(0) =1a(1) =2a(2) =4a(3) =3a(4) =10a(5) =21a(6) =5a(7) =22a(8) =73a(9) =192a(10) =7a(11) =44a(12) =190a(13) =703a(14) =2035a(15) =11a(16) =91a(17) =510a(18) =2287a(19) =8581a(20) =27407a(21) =15a(22) =172a(23) =1196a(24) =6738a(25) =30209a(26) =118461a(27) =399618a(28) =22a(29) =326
External references
- oeis: A360629