7157114189

Appears in sequences

• 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.at n=27A348453
• Number of ways to dissect a 2*n X 2*n chessboard into two polyominoes each of area 2*n^2.at n=4A348456