Polyotessamino numbers T(n,k) (1<=k<=n): take all the polyominoes with n cells (including those with holes but excluding rotations and reflections); fill them as completely as possible with rectangular 1 X k tiles; T(n,k) is number of ways of doing this.

A059573

Polyotessamino numbers T(n,k) (1<=k<=n): take all the polyominoes with n cells (including those with holes but excluding rotations and reflections); fill them as completely as possible with rectangular 1 X k tiles; T(n,k) is number of ways of doing this.

Terms

    a(0) =1a(1) =1a(2) =1a(3) =2a(4) =4a(5) =1a(6) =5a(7) =8a(8) =4a(9) =1a(10) =12a(11) =34a(12) =18a(13) =4a(14) =1a(15) =35a(16) =85a(17) =61a(18) =22a(19) =5a(20) =1

External references