Packing with consecutive squares (Ed Pegg jr.)

Discuss about this problem

Packing squares or rectangles into larger rectangles A081287: 0,1,1,5,5,8,14,6,15,20,7,17,17,20,25,16,9,30,21,20,33 http://www.cc.gatech.edu/fac/Sven.Koenig/icaps/icaps04/icapspapers/ICAPS04KorfR.pdf http://www.eecs.harvard.edu/~michaelm/postscripts/ipl2004.pdf 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 1 2 3 5 5 9 11 14 15 15 19 23 22 23 23 28 39 31 47 34 38 39 64 56 43 1 3 5 7 12 11 14 15 20 27 27 29 38 45 55 54 46 69 53 85 88 98 68 88 129 Excess area when consecutive squares of size 1 to n are packed into the smallest possible rectangle. Can be generalized to 3 dimensions. For every N=1...50, place all consecutive squares from 1 to N into the smallest possible rectangle