A059571 From Mertens's conjecture (1): floor(sqrt(n)) - |M(n)|, where M is Mertens's function A002321.
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
Keywords
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.
Links
- Paolo Xausa, Table of n, a(n) for n = 1..10000
- A. M. Odlyzko and H. J. J. te Riele, Disproof of the Mertens conjecture, J. reine angew. Math., 357 (1985), pp. 138-160.
Programs
-
Mathematica
Table[Floor[Sqrt[n]] - Abs[Plus @@ MoebiusMu[Range[n]]], {n, 1, 80}] (* Carl Najafi, Aug 17 2011 *)
Comments