Irregular triangle read by rows: T(n,k) (n >= 1, 1 <= k <= n^2) is the number of ways to tile an n X n chessboard with rook-connected polyominoes of area k.
A348454
Irregular triangle read by rows: T(n,k) (n >= 1, 1 <= k <= n^2) is the number of ways to tile an n X n chessboard with rook-connected polyominoes of area k.
Terms
- a(0) =1a(1) =1a(2) =2a(3) =0a(4) =1a(5) =1a(6) =0a(7) =10a(8) =0a(9) =0a(10) =0a(11) =0a(12) =0a(13) =1a(14) =1a(15) =36a(16) =0a(17) =117a(18) =0a(19) =0a(20) =0a(21) =70a(22) =0a(23) =0a(24) =0a(25) =0a(26) =0a(27) =0a(28) =0a(29) =1
External references
- oeis: A348454