OFFSET
1,2
COMMENTS
The entries for n=1, 2, 8, 15, 16, 17, 19, 20, 21, 22, 23, 25, 27, 29, 30, 31, 35, 36, 37, 39, 41, 43, 44, 45, 46, 49, 50, 51, 54, and 56 all meet the lower bound in A092137 and are therefore correct. - Stuart E Anderson, Jan 05 2008
Simonis, H. and O'Sullivan showed that a(26) = 80. - Erich Friedman, May 27 2009
Houhardy S. showed a(32)=108, a(33)=113, a(34)=118, and a(47)=190. - Erich Friedman, Oct 11 2010
The values have been proved correct except those for n=38, 40, 42, 48, 52, 53 and 55, where they remain probable. - Erich Friedman, Oct 11 2010
REFERENCES
H. T. Croft, K. J. Falconer and R. K. Guy, Unsolved Problems in Geometry, D5.
M. Gardner, Mathematical Carnival. Random House, NY, 1977, p. 147.
Simonis, H. and O'Sullivan, B., Search Strategies for Rectangle Packing, in Proceedings of the 14th international conference on Principles and Practice of Constraint Programming, Springer-Verlag Berlin, Heidelberg, 2008, pp. 52-66.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
LINKS
János Balogh, György Dósa, Lars Magnus Hvattum, Tomas Olaj, and Zsolt Tuza, Guillotine cutting is asymptotically optimal for packing consecutive squares, Optimization Letters (2022).
Erich Friedman, Math Magic.
S. Hougardy, A Scale Invariant Algorithm for Packing Rectangles Perfectly, 2012. - From N. J. A. Sloane, Oct 15 2012
S. Hougardy, A Scale Invariant Exact Algorithm for Dense Rectangle Packing Problems, 2012.
Minami Kawasaki, Catalogue of best known solutions
R. E. Korf, Optimal Rectangle Packing: New Results, Proceedings of the International Conference on Automated Planning and Scheduling (ICAPS04), Whistler, British Columbia, June 2004, pp. 142-149. [From Rob Pratt, Jun 10 2009]
Takehide Soh, Packing Consequtive Squares into a Sqaure (sic), Kobe University (Japan, 2019).
CROSSREFS
KEYWORD
nonn
AUTHOR
STATUS
approved