A279596 - cp's OEIS frontend

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

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

[2, 2, 3, 3, 3, 3, 3, 4, 4, 4, 4, 4, 5, 5, 5, 6, 6, 4, 6, 6, 6, 6, 6, 6, 7, 7, 7, 8, 7, 6, 6, 8, 7, 8, 8, 8, 8, 8, 8, 8, 8, 8, 9]