cp's OEIS Frontend

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.

A092137 Lower bound for A005842(n).

Original entry on oeis.org

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

Views

Author

Rob Pratt, Mar 30 2004

Keywords

Comments

Area of square must be large enough to contain all n squares without overlap.

Crossrefs

Cf. A005842.

Programs

  • Mathematica
    Table[Ceiling[Sqrt[Sum[k^2, {k, 1, n}]]], {n, 1, 50}]

Formula

a(n) = ceiling(sqrt(Sum_{k=1..n} k^2)).