A279848 - cp's OEIS frontend

A279848 Partition an n X n square into multiple integer-sided rectangles where no one is a translation of any other. a(n) is ceiling(n/log(n)) - the least possible difference between the largest and smallest area.

n	a(n)
3	1
4	1
5	1
6	1
7	1
8	1
9	2
10	1
11	1
12	1
13	2
14	2
15	1
16	1
17	2
18	1
19	1
20	3
21	1
22	2
23	2
24	2
25	2
26	2
27	2
28	2
29	2
30	1
31	3
32	4
33	4
34	2
35	3
36	3
37	3
38	3
39	3
40	3
41	4
42	4
43	4
44	4
45	3

[1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 2, 2, 1, 1, 2, 1, 1, 3, 1, 2, 2, 2, 2, 2, 2, 2, 2, 1, 3, 4, 4, 2, 3, 3, 3, 3, 3, 3, 4, 4, 4, 4, 3]