|
Search: id: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, 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
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
Area of square must be large enough to contain all n squares without overlap.
|
|
FORMULA
|
a(n) = ceil(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: A156624 A025201 A071259 this_sequence A059608 A088071 A024182
Adjacent sequences: A092134 A092135 A092136 this_sequence A092138 A092139 A092140
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Rob Pratt (Rob.Pratt(AT)sas.com), Mar 30 2004
|
|
|
Search completed in 0.002 seconds
|
