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 A092137 #6 Jun 16 2019 08:07:41
%S A092137 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 A092137 75,79,84,88,93,98,103,107,112,117,123,128,133,138,144,149,155,160,
%U A092137 166,172,178,184,189,195,202,208
%N A092137 Lower bound for A005842(n).
%C A092137 Area of square must be large enough to contain all n squares without overlap.
%F A092137 a(n) = ceiling(sqrt(Sum_{k=1..n} k^2)).
%t A092137 Table[Ceiling[Sqrt[Sum[k^2, {k, 1, n}]]], {n, 1, 50}]
%Y A092137 Cf. A005842.
%K A092137 easy,nonn
%O A092137 1,2
%A A092137 _Rob Pratt_, Mar 30 2004