OFFSET
0,3
COMMENTS
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.
LINKS
Alois P. Heinz, Table of n, a(n) for n = 0..750
FORMULA
a(n) = Sum_{k>=1} k*A096771(n,k).
PROG
(PARI) a(n)={my(s=0); if(n, forpart(p=n, s += max(#p, p[#p]))); s}
CROSSREFS
KEYWORD
nonn
AUTHOR
Andrew Howroyd, Jan 12 2024
STATUS
approved