OFFSET
1,2
COMMENTS
It seems that each solution consists of n*k/(r*s) copies of an r X s piece (arranged in a simple grid, all pieces oriented in the same way), where r is a divisor of n, s is a divisor of k, and either r = s or r is not a divisor of k or s is not a divisor of n. If this is true, T(n,k) <= d(n)*d(k) - d(m)*(d(m)-1), where d = A000005 is the divisor count function and m = gcd(n,k). Equality does not always hold; for (n,k) = (3,2), for example, (r,s) = (1,2) satisfies the condition, but three 1 X 2 pieces can tile the 3 X 2 rectangle in more than one way.
Is d(n)*d(k) - T(n,k) eventually periodic in n for each k?
FORMULA
EXAMPLE
Triangle begins:
n\k| 1 2 3 4 5 6
---+------------------
1 | 1
2 | 2 2
3 | 2 3 2
4 | 3 4 4 3
5 | 2 3 3 4 2
6 | 4 6 5 7 5 4
The T(4,3) = 4 nonrearrangeable tilings of the 4 X 3 rectangle are:
+---+---+---+ +---+---+---+ +---+---+---+ +---+---+---+
| | | | | | | | | | | |
+ + + + + + + + +---+---+---+
| | | | | | | | | | | |
+ + +---+---+---+ + + + + +---+---+---+
| | | | | | | | | | | |
+ + + + + + + + +---+---+---+
| | | | | | | | | | | |
+---+---+---+ +---+---+---+ +---+---+---+ +---+---+---+
CROSSREFS
KEYWORD
AUTHOR
Pontus von Brömssen, Feb 28 2023
STATUS
approved