|
%I #24 Nov 17 2022 10:02:30
%S 1,2,4,5,7,8,12,12,16,15,20,24,26,25,30,29,35,33,40,40,47,46,61,51,73,
%T 56,63,61,71,71,82,82,90,83,96,95,108,99,108,111,127,102,146,144,130,
%U 150,150,161,144,160,175,173,186,162,183,179,200,182,202,197,226
%N a(n) is the maximum number of rows of width n that can be filled by stacking squares of sizes 1 through n without creating voids or overhangs.
%C No square of any size can be used more than once. The initial terms listed are conjectured from what I can draw. Trying to stack squares in this way feels like playing Tetris and comes from the squared square idea (see A295130).
%H Pontus von Brömssen, <a href="/A350417/a350417.svg">A350417(61) = 226</a>.
%e |‾‾‾‾‾‾‾‾‾‾‾|
%e | |
%e | 5 |
%e | | a(7)=12
%e |___________||‾‾‾|
%e |‾‾‾‾‾‾‾‾||_||___|
%e | 4 ||‾‾‾‾‾‾|
%e | || 3 |
%e |________||______|
%e | 7 |
%e .
%e .
%e |‾‾‾‾‾‾|
%e |‾‾‾‾‾‾‾‾‾‾‾‾‾|| 3 | a(10)=15
%e | || ||‾|
%e | 6 ||‾‾‾‾‾‾‾‾‾|
%e | || 4 |
%e | || |
%e |_____________||_________|
%e | 10 |
%Y Cf. A295130.
%K nonn
%O 1,2
%A _Antoine Beaulieu_, Dec 29 2021
%E a(19) corrected by, a(21) and beyond from _Pontus von Brömssen_, Nov 15 2022
|
