The OEIS is supported by the many generous donors to the OEIS Foundation.

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A059581 From Von Sterneck's conjecture: floor(sqrt(n)) - 2*|Mertens's function A002321(n)|. 1
 -1, 1, -1, 0, -2, 0, -2, -2, -1, 1, -1, -1, -3, -1, 1, 2, 0, 0, -2, -2, 0, 2, 0, 0, 1, 3, 3, 3, 1, -1, -3, -3, -1, 1, 3, 4, 2, 4, 6, 6, 4, 2, 0, 0, 0, 2, 0, 0, 1, 1, 3, 3, 1, 1, 3, 3, 5, 7, 5, 5, 3, 5, 5, 6, 8, 6, 4, 4, 6, 4, 2, 2, 0, 2, 2, 2, 4, 2, 0, 0, 1, 3, 1, 1, 3, 5, 7, 7, 5, 5, 7, 7, 9 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,5 COMMENTS Von Sterneck conjectured that 2*|A002321(n)| < sqrt(n) for all sufficiently large n. This is now known to be false. This is different from the Mertens conjecture that |A002321(n)| < sqrt(n) for all n > 1 (which is also false). REFERENCES D. S. Mitrinovic et al., Handbook of Number Theory, Kluwer, Section VI.2, p. 188. LINKS Table of n, a(n) for n=1..93. MATHEMATICA Table[Floor[Sqrt[n]] - 2 Abs[Plus @@ MoebiusMu[Range[n]]], {n, 1, 80}] (* Carl Najafi, Aug 17 2011 *) CROSSREFS Cf. A002321, A059571. Sequence in context: A158950 A213013 A242667 * A344319 A236998 A297116 Adjacent sequences: A059578 A059579 A059580 * A059582 A059583 A059584 KEYWORD sign AUTHOR N. J. A. Sloane, Feb 16 2001 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 5 09:29 EST 2023. Contains 367589 sequences. (Running on oeis4.)