442791

Appears in sequences

• T(n,m) = Number of ways to partition an nXm grid into 4 connected equal-area regions.at n=60A167260
• 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 k rook-connected polyominoes of equal area.at n=58A348452
• 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=18A348453
• 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.at n=63A348454
• 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 rook-connected polyominoes of area d_k, where d_k is the k-th divisor of n^2.at n=20A348455