Triangle read by rows: T(n,k) = number of ways, summed over the free n-ominoes, that an n-omino with an assigned orientation can be maximally (partially) covered by k X 1 tiles.
A308437
Triangle read by rows: T(n,k) = number of ways, summed over the free n-ominoes, that an n-omino with an assigned orientation can be maximally (partially) covered by k X 1 tiles.
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) =35a(12) =18a(13) =4a(14) =1a(15) =35a(16) =89a(17) =61a(18) =22a(19) =5a(20) =1a(21) =108a(22) =425a(23) =206a(24) =97a(25) =28a(26) =5a(27) =1a(28) =369a(29) =1438
External references
- oeis: A308437