This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A368985 #9 Jan 14 2024 16:33:13
%S A368985 0,1,4,8,16,27,47,72,115,170,255,364,527,732,1026,1401,1916,2568,3451,
%T A368985 4556,6023,7859,10245,13217,17041,21766,27770,35173,44471,55874,70092,
%U A368985 87432,108881,134951,166948,205678,252951,309908,379032,462046,562246,682130
%N A368985 a(n) = sum of the side lengths of the minimum containing squares of all partitions of n.
%C A368985 The minimum containing square of a partition has its side length equal to the number of parts or the size of the largest part whichever is greater. a(n) is the sum of the side lengths over all partitions of n.
%H A368985 Alois P. Heinz, <a href="/A368985/b368985.txt">Table of n, a(n) for n = 0..750</a>
%F A368985 a(n) = Sum_{k>=1} k*A096771(n,k).
%o A368985 (PARI) a(n)={my(s=0); if(n, forpart(p=n, s += max(#p, p[#p]))); s}
%Y A368985 Cf. A096771, A115995, A182094.
%K A368985 nonn
%O A368985 0,3
%A A368985 _Andrew Howroyd_, Jan 12 2024