%I #6 Jun 16 2019 08:07:41
%S 1,3,4,6,8,10,12,15,17,20,23,26,29,32,36,39,43,46,50,54,58,62,66,70,
%T 75,79,84,88,93,98,103,107,112,117,123,128,133,138,144,149,155,160,
%U 166,172,178,184,189,195,202,208
%N Lower bound for A005842(n).
%C Area of square must be large enough to contain all n squares without overlap.
%F a(n) = ceiling(sqrt(Sum_{k=1..n} k^2)).
%t Table[Ceiling[Sqrt[Sum[k^2, {k, 1, n}]]], {n, 1, 50}]
%Y Cf. A005842.
%K easy,nonn
%O 1,2
%A _Rob Pratt_, Mar 30 2004