|
| |
|
|
A060655
|
|
Pack n integer sided rectangles into the smallest possible square so that no sides of the rectangle are the same. Sequence gives the side of the smallest square.
|
|
0
| |
|
|
2, 4, 6, 8, 11, 14, 18, 21, 25, 29, 33, 37
(list; graph; refs; listen; history; internal format)
|
| |
| |
|
|
