A278970 - cp's OEIS frontend

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.

n	a(n)
3	4
4	2
5	3
6	2
7	2
8	1
9	2
10	0
11	2
12	1
13	1
14	3
15	1
16	1
17	2
18	2
19	2
20	1
21	1
22	2
23	3
24	2
25	1
26	2
27	2
28	3
29	3
30	1
31	2
32	3
33	1
34	1
35	2
36	2
37	3
38	4
39	3
40	2
41	2
42	3
43	3
44	3
45	2
46	3
47	4
48	2
49	4
50	3
51	2
52	4
53	3
54	2
55	3
56	3
57	3
58	3
59	4
60	3
61	3
62	5
63	4
64	4
65	4

[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]

cp's OEIS Frontend

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.

Table of values

List of values

n	a(n)
3	4
4	2
5	3
6	2
7	2
8	1
9	2
10	0
11	2
12	1
13	1
14	3
15	1
16	1
17	2
18	2
19	2
20	1
21	1
22	2
23	3
24	2
25	1
26	2
27	2
28	3
29	3
30	1
31	2
32	3
33	1
34	1
35	2
36	2
37	3
38	4
39	3
40	2
41	2
42	3
43	3
44	3
45	2
46	3
47	4
48	2
49	4
50	3
51	2
52	4
53	3
54	2
55	3
56	3
57	3
58	3
59	4
60	3
61	3
62	5
63	4
64	4
65	4

n	a(n)
3	4
4	2
5	3
6	2
7	2
8	1
9	2
10	0
11	2
12	1
13	1
14	3
15	1
16	1
17	2
18	2
19	2
20	1
21	1
22	2
23	3
24	2
25	1
26	2
27	2
28	3
29	3
30	1
31	2
32	3
33	1
34	1
35	2
36	2
37	3
38	4
39	3
40	2
41	2
42	3
43	3
44	3
45	2
46	3
47	4
48	2
49	4
50	3
51	2
52	4
53	3
54	2
55	3
56	3
57	3
58	3
59	4
60	3
61	3
62	5
63	4
64	4
65	4

n	a(n)
3	4
4	2
5	3
6	2
7	2
8	1
9	2
10	0
11	2
12	1
13	1
14	3
15	1
16	1
17	2
18	2
19	2
20	1
21	1
22	2
23	3
24	2
25	1
26	2
27	2
28	3
29	3
30	1
31	2
32	3
33	1
34	1
35	2
36	2
37	3
38	4
39	3
40	2
41	2
42	3
43	3
44	3
45	2
46	3
47	4
48	2
49	4
50	3
51	2
52	4
53	3
54	2
55	3
56	3
57	3
58	3
59	4
60	3
61	3
62	5
63	4
64	4
65	4