cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A276523 Partition an n X n square into multiple non-congruent integer-sided rectangles. a(n) is the least possible difference between the largest and smallest area.

Table of values

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

List of values

[2, 4, 4, 5, 5, 6, 6, 8, 6, 7, 8, 6, 8, 8, 8, 8, 8, 9, 9, 9, 8, 9, 10, 9, 10, 9, 9, 11, 11, 10, 12, 12, 11, 12, 11, 10, 11, 12, 13, 12, 12, 12, 13, 13, 12, 14, 12, 13, 14, 13, 14, 15, 14, 14, 15, 15, 14, 15, 15, 14, 15, 15, 15]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.