264500

Appears in sequences

• Number of ways to partition an n X 6 grid into 3 connected equal-area regions.at n=5A167253
• T(n,m) = Number of ways to partition an nXm grid into 3 connected equal-area regions.at n=60A167259
• Numbers such that the list of exponents of their factorization is a palindromic list of primes.at n=35A322525
• 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=57A348452
• 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=17A348453
• 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=66A348454
• 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=21A348455