Packing with multiple consecutive cubes (Erich Friedmann)	Discuss about this problem
A??????: 1,4,<=8,<=24,<= 32 minimum value of k so that k copies each of cubes of sides 1 through n can be used to exactly fill some rectangular box. For every N=1...50, place k copies of every cube of size 1 to N into the smallest possible rectangular box