
COMMENTS

If ceiling(n/log(n)) is an upper bound for the Mondrian Art Problem variant (A279596), a(n) is the amount by which the optimal value beats the upper bound.
Terms a(3) to a(45) verified optimal by R. Gerbicz.
Term a(103) is at least 9, defect 14 (630616) with 17 rectangles.
Best values known for a(46) to a(96): 3, 1, 2, 1, 1, 5, 2, 2, 1, 2, 2, 1, 1, 0, 3, 0, 2, 1, 2, 0, 0, 1, 1, 1, 1, 0, 1, 1, 4, 1, 0, 2, 0, 3, 1, 4, 3, 1, 1, 4, 2, 3, 1, 0, 4, 4, 0, 1, 1, 0, 0.
