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.

A059571 From Mertens's conjecture (1): floor(sqrt(n)) - |M(n)|, where M is Mertens's function A002321.

Original entry on oeis.org

0, 1, 0, 1, 0, 1, 0, 0, 1, 2, 1, 1, 0, 1, 2, 3, 2, 2, 1, 1, 2, 3, 2, 2, 3, 4, 4, 4, 3, 2, 1, 1, 2, 3, 4, 5, 4, 5, 6, 6, 5, 4, 3, 3, 3, 4, 3, 3, 4, 4, 5, 5, 4, 4, 5, 5, 6, 7, 6, 6, 5, 6, 6, 7, 8, 7, 6, 6, 7, 6, 5, 5, 4, 5, 5, 5, 6, 5, 4, 4, 5, 6, 5, 5, 6, 7, 8, 8, 7, 7, 8, 8, 9
Offset: 1

Views

Author

N. J. A. Sloane, Feb 16 2001

Keywords

Comments

Mertens conjectured that |A002321(n)| < sqrt(n) for all n > 1. This is now known to be false. So eventually there will be negative terms.

References

  • D. S. Mitrinovic et al., Handbook of Number Theory, Kluwer, Section VI.2.
  • K. H. Rosen et al., eds., Handbook of Discrete and Combinatorial Mathematics, CRC Press, 2000; p. 267.

Crossrefs

Programs

  • Mathematica
    Table[Floor[Sqrt[n]] - Abs[Plus @@ MoebiusMu[Range[n]]], {n, 1, 80}] (* Carl Najafi, Aug 17 2011 *)