|
Search: id:A081287
|
|
|
| A081287 |
|
Excess area when consecutive squares of sizes 1 to n are packed into the smallest possible rectangle. |
|
+0
2
|
|
| 0, 1, 1, 5, 5, 8, 14, 6, 15, 20, 7, 17, 17, 20, 25, 16, 9, 30, 21, 20, 33, 27, 28, 28, 22, 29, 26
(list; graph; listen)
|
|
|
OFFSET
|
1,4
|
|
|
COMMENT
|
Restricted to packings with the squares aligned with the sides of the rectangle.
Verified best rectangles >5 are as follows (the dots are just to maintain the alignment):
.6. 7. 8. 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24. 25 26 27
------------------------------------------------------------------
.9 11 14 15 15 19 23 22 23 23 28 39 31 47 34 38 39 64 56. 43 70 74
11 14 15 20 27 27 29 38 45 55 54 46 69 53 85 88 98 68 88 129 89 94
|
|
REFERENCES
|
R. K. Guy, Unsolved Problems in Geometry, Section D4, has information about several related problems.
R. M. Kurchan (editor), Puzzle Fun, Number 18 (December 1997), pp. 9-10.
|
|
LINKS
|
Ed Pegg Jr, Packing squares
Richard E. Korf, Optimal Rectangle Packing: New Results.
E. Pegg and R. Korf, Tightly Packed Squares.
|
|
EXAMPLE
|
Visual representations are at the Tightly Packed Squares link.
|
|
CROSSREFS
|
Cf. A038666.
Sequence in context: A021183 A003861 A107623 this_sequence A019843 A046567 A046600
Adjacent sequences: A081284 A081285 A081286 this_sequence A081288 A081289 A081290
|
|
KEYWORD
|
nice,nonn
|
|
AUTHOR
|
Ed Pegg Jr (ed(AT)mathpuzzle.com), Mar 16 2003
|
|
EXTENSIONS
|
Four extra terms computed by Korf, May 24 2005
More terms from Ed Pegg Jr (ed(AT)mathpuzzle.com), Feb 14 2008
|
|
|
Search completed in 0.002 seconds
|
