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.

A379786 a(n) = A379059(n) - 2*n.

Original entry on oeis.org

0, -1, -2, -1, -2, -3, -2, -3, -4, 4, 3, 2, 1, -5, 5, 4, 3, 2, -4, 8, 5, 2, 4, 1, 4, -7, -3, -4, -5, 6, 3, 0, -3, -1, -2, -3, -4, -5, -6, -7, -8, -9, -2, -3, -4, -5, -6, -7, -8, -9, -10, -1, -2, -3, -4, -5, -6, -7, -8, -9, -10, -11, -2, -3, -4, -5, -6, -7, -8, -9, -10, -11, -12, 2, 1, 0, -1, -2, -3, -4, -5, -6, -7, -8, -9, -10, 16, 13
Offset: 0

Views

Author

N. J. A. Sloane, Jan 13 2025

Keywords

Comments

Conjecture: For n >= 10, |a(n)| < 2*sqrt(n); for n >= 1000, |a(n)| < 1.59*sqrt(n). - N. J. A. Sloane, Jan 19 2025

Crossrefs