|
%I #28 Mar 02 2024 03:28:24
%S 1,6,15,35,60,99,154,210,300,405,513,667,836,1035,1265,1512,1794,2139,
%T 2491,2890,3344,3822,4352,4928,5547,6230,6956,7749,8586,9486,10450,
%U 11475
%N Minimum area rectangle into which squares of sizes 1, 2, 3, ... n can be packed.
%D R. M. Kurchan (editor), Puzzle Fun, Number 18 (December 1997), pp. 9-10.
%D R. M. Kurchan (editor), Solutions of Puzzle Fun 18, Puzzle Fun, Number 22 (2000), pp. 8-10.
%H Jean-François Alcover, <a href="/A038666/a038666.txt">Mathematica script (after E. Pegg and R. Korf)</a>
%H R. Ellard and D. MacHale, <a href="https://doi.org/10.1017/S0025557200003922">Packing Squares into Rectangles</a>, The Mathematical Gazette, Vol. 96, No. 535 (March 2012), 1-18.
%H E. Huang and R. E. Korf, <a href="http://ijcai.org/papers09/Papers/IJCAI09-092.pdf">New Improvements in Optimal Rectangle Packing</a>, IJCAI-09: Proceedings of the 21st International Joint Conference on Artificial Intelligence, AAAI Press, 2009, pages 511-516. (Table 1 incorrectly lists the 95 X 110 minimal rectangle for n = 31 as 91 X 110.)
%H Ed Pegg, Jr., <a href="http://www.mathpuzzle.com/17sqrsrect.gif">Illustration of 17th term</a>
%F a(n) = A000330(n) + A081287(n). - _Pontus von Brömssen_, Mar 01 2024
%Y Cf. A000330, A081287.
%K nonn,more
%O 1,2
%A _Erich Friedman_
%E Corrected and extended by _William Rex Marshall_, Mar 23 2002 and Aug 29 2002
%E a(22)-a(32) from Korf, communicated by _William Rex Marshall_, May 03 2012
|
