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.

A259225 Smallest oblong number greater than or equal to n.

Original entry on oeis.org

0, 2, 2, 6, 6, 6, 6, 12, 12, 12, 12, 12, 12, 20, 20, 20, 20, 20, 20, 20, 20, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 72, 72, 72, 72, 72, 72, 72, 72, 72, 72
Offset: 0

Views

Author

Michel Marcus, Jun 21 2015

Keywords

Crossrefs

Cf. A002378 (oblong numbers), A048761 (similar, with square instead).

Programs

  • Mathematica
    f[n_] := n*(n + 1); g[n_] := (Sqrt[4*n + 1] - 1)/2; a[n_] := f[Ceiling[g[n]]]; Array[a, 100, 0] (* Amiram Eldar, Aug 16 2022 *)
  • PARI
    a(n) = my(k = 0); while(k*(k+1)
    				

Formula

Sum_{n>=1} 1/a(n)^2 = 4 - Pi^2/3. - Amiram Eldar, Aug 16 2022