login
A092137
Lower bound for A005842(n).
1
1, 3, 4, 6, 8, 10, 12, 15, 17, 20, 23, 26, 29, 32, 36, 39, 43, 46, 50, 54, 58, 62, 66, 70, 75, 79, 84, 88, 93, 98, 103, 107, 112, 117, 123, 128, 133, 138, 144, 149, 155, 160, 166, 172, 178, 184, 189, 195, 202, 208
OFFSET
1,2
COMMENTS
Area of square must be large enough to contain all n squares without overlap.
FORMULA
a(n) = ceiling(sqrt(Sum_{k=1..n} k^2)).
MATHEMATICA
Table[Ceiling[Sqrt[Sum[k^2, {k, 1, n}]]], {n, 1, 50}]
CROSSREFS
Cf. A005842.
Sequence in context: A025201 A071259 A231405 * A206580 A291899 A059608
KEYWORD
easy,nonn
AUTHOR
Rob Pratt, Mar 30 2004
STATUS
approved