Pack n integer-sided rectangles into the smallest possible square so that no sides of the rectangle are the same. Sequence gives the side of the smallest square.

A060655

Pack n integer-sided rectangles into the smallest possible square so that no sides of the rectangle are the same. Sequence gives the side of the smallest square.

Terms

    a(0) =2a(1) =4a(2) =6a(3) =8a(4) =11a(5) =14a(6) =18a(7) =21a(8) =24a(9) =28a(10) =32a(11) =37a(12) =41a(13) =46a(14) =51a(15) =55a(16) =60

External references