|
|
A278970
|
|
Partition an n X n square into multiple non-congruent integer-sided rectangles. a(n) is ceiling(n/log(n)) + 3 - the least possible difference between the largest and smallest area.
|
|
3
|
|
|
4, 2, 3, 2, 2, 1, 2, 0, 2, 1, 1, 3, 1, 1, 2, 2, 2, 1, 1, 2, 3, 2, 1, 2, 2, 3, 3, 1, 2, 3, 1, 1, 2, 2, 3, 4, 3, 2, 2, 3, 3, 3, 2, 3, 4, 2, 4, 3, 2, 4, 3, 2, 3, 3, 3, 3, 4, 3, 3, 5, 4, 4, 4
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
3,1
|
|
COMMENTS
|
If ceiling(n/log(n)) + 3 is an upper bound for the Mondrian Art Problem (A276523), a(n) is the amount by which the optimal value beats the upper bound.
Terms a(86) and a(139) are at least 5. Term a(280) is at least 7.
Term a(138) is at least 9, defect 22 (1200-1178) with 16 rectangles.
Best values known for a(66) to a(96): 3, 1, 1, 2, 1, 2, 0, 1, 1, 1, 2, 1, 0, 1, 2, 1, 2, 2, 1, 1, 5, 1, 3, 1, 0, 1, 2, 2, 0, 0, 1.
|
|
LINKS
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,hard,more
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|