315107

Appears in sequences

• Triangle read by rows: T(n,k) is the maximum number of ways in which a set of integer-sided rectangular pieces can tile an n X k rectangle, up to rotations and reflections.at n=14A361221
• Maximum number of ways in which a set of integer-sided rectangular pieces can tile an n X n square, up to rotations and reflections.at n=4A361222