Irregular triangle read by rows: T(n,k) (n >= 1, 1 <= k <= number of divisors of n^2) is the number of ways to tile an n X n chessboard with d_k rook-connected polyominoes of equal area, where d_k is the k-th divisor of n^2.
A348453
Irregular triangle read by rows: T(n,k) (n >= 1, 1 <= k <= number of divisors of n^2) is the number of ways to tile an n X n chessboard with d_k rook-connected polyominoes of equal area, where d_k is the k-th divisor of n^2.
Terms
- a(0) =1a(1) =1a(2) =2a(3) =1a(4) =1a(5) =10a(6) =1a(7) =1a(8) =70a(9) =117a(10) =36a(11) =1a(12) =1a(13) =4006a(14) =1a(15) =1a(16) =80518a(17) =264500a(18) =442791a(19) =451206a(20) =178939a(21) =80092a(22) =6728a(23) =1a(24) =1a(25) =158753814a(26) =1a(27) =7157114189
External references
- oeis: A348453