Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A084235
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A084235 Smallest k such that |M(k)| = n^2, where M(x) is Mertens's function A002321. +0
1
1, 5, 31, 199, 1637, 8507, 24110, 95961, 355541, 1786062, 6473791, 30649362, 109851909, 456774199 (list; graph; listen)
OFFSET

1,2

REFERENCES

Karl Sabbagh, The Riemann Hypothesis, The Greatest Unsolved Problem in Mathematics, Farrar, Straus and Giroux, New York, 2002, page 191.

MATHEMATICA

i = s = 0; Do[ While[ Abs[s] < 2^n, s = s + MoebiusMu[i]; i++ ]; Print[i - 1], {n, 1, 25}]

CROSSREFS

Cf. A051402.

Adjacent sequences: A084232 A084233 A084234 this_sequence A084236 A084237 A084238

Sequence in context: A015540 A014987 A108079 this_sequence A002469 A092636 A007197

KEYWORD

nonn,more

AUTHOR

Robert G. Wilson v (rgwv(AT)rgwv.com), May 13 2003

EXTENSIONS

No other entries < 975900000.

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 21 00:02 EST 2008. Contains 150810 sequences.


AT&T Labs Research