3899340

Appears in sequences

• Triangle read by rows: T(n,k) is the maximum number of ways in which a set of integer-sided squares can tile an n X k rectangle, 0 <= k <= n.at n=44A362142
• Maximum number of ways in which a set of integer-sided squares can tile an n X n square.at n=8A362143