login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A029833 A discrete version of the Mangoldt function: if n is prime then round(log(n)) else 0. 4
0, 1, 1, 0, 2, 0, 2, 0, 0, 0, 2, 0, 3, 0, 0, 0, 3, 0, 3, 0, 0, 0, 3, 0, 0, 0, 0, 0, 3, 0, 3, 0, 0, 0, 0, 0, 4, 0, 0, 0, 4, 0, 4, 0, 0, 0, 4, 0, 0, 0, 0, 0, 4, 0, 0, 0, 0, 0, 4, 0, 4, 0, 0, 0, 0, 0, 4, 0, 0, 0, 4, 0, 4, 0, 0, 0, 0, 0, 4, 0 (list; graph; refs; listen; history; internal format)
OFFSET

1,5

COMMENTS

The real Mangoldt function Lambda(n) is equal to log(n) if n is prime else 0.

REFERENCES

T. M. Apostol, Introduction to Analytic Number Theory, Springer-Verlag, 1976, page 32.

P. Ribenboim, Algebraic Numbers, p. 44.

CROSSREFS

Cf. A029832, A029834, A053821.

Sequence in context: A198255 A029834 A202385 * A050948 A062590 A139215

Adjacent sequences:  A029830 A029831 A029832 * A029834 A029835 A029836

KEYWORD

nonn,easy

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com).

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 21:56 EST 2012. Contains 205860 sequences.