1,2

I have a list of rectangles 1, 2, 3, 4, 5, 6 (for the above examples). I am using a recursion program to perform a branch and bound method of the knapsack problem (actually the 2D cutting stock problem). The sequence is the number of iterations of the subprogram that my program produced. The rectangle is placed and then two options are produced. Each option has two different rectangles in which the next target rectangle can be put in. Thus there are 4 calls to the subprogram for each rectangle, yet each rectangle can also be turned sideways.

Sequence in context: A048446 A001282 A135214 this_sequence A142898 A159678 A097830

Adjacent sequences: A090377 A090378 A090379 this_sequence A090381 A090382 A090383

nonn,obsc

Stuart Reed (stu96art(AT)yahoo.com), Jan 29 2004

Definition reworded by M. F. Hasler (MHasler(AT)univ-ag.fr), Apr 07 2009