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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A053821 A discrete approximation to log(n): Sum_{ d divides n } A029833(d). 4
0, 1, 1, 1, 2, 2, 2, 1, 1, 3, 2, 2, 3, 3, 3, 1, 3, 2, 3, 3, 3, 3, 3, 2, 2, 4, 1, 3, 3, 4, 3, 1, 3, 4, 4, 2, 4, 4, 4, 3, 4, 4, 4, 3, 3, 4, 4, 2, 2, 3, 4, 4, 4, 2, 4, 3, 4, 4, 4, 4, 4, 4, 3, 1, 5, 4, 4, 4, 4, 5, 4, 2, 4, 5, 3, 4, 4, 5, 4, 3, 1, 5, 4, 4, 5, 5, 4, 3, 4, 4, 5, 4, 4 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,5
COMMENTS
For n >= 1, log(n) = Sum_{ d divides n } Lambda(d), where Lambda is the real Mangoldt function (see A029833).
REFERENCES
T. M. Apostol, Introduction to Analytic Number Theory, Springer-Verlag, 1976, page 32, Cf. Theorem 2.10.
LINKS
CROSSREFS
Sequence in context: A206827 A098593 A144431 * A076545 A162246 A277447
KEYWORD
nonn,easy
AUTHOR
N. J. A. Sloane, Apr 08 2000
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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 19 19:02 EDT 2024. Contains 371798 sequences. (Running on oeis4.)