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

 

Logo

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A029834 A discrete version of the Mangoldt function: if n is prime then floor(log(n)) else 0. 4
0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 2, 0, 2, 0, 0, 0, 2, 0, 2, 0, 0, 0, 3, 0, 0, 0, 0, 0, 3, 0, 3, 0, 0, 0, 0, 0, 3, 0, 0, 0, 3, 0, 3, 0, 0, 0, 3, 0, 0, 0, 0, 0, 3, 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; text; internal format)
OFFSET

1,11

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.

Paulo Ribenboim, Algebraic Numbers, p. 44.

LINKS

Table of n, a(n) for n=1..80.

MATHEMATICA

Array[If[PrimeQ[#], Floor[Log[#]], 0] &, 80] (* Harvey P. Dale, Jul 24 2013 *)

PROG

(PARI) v=[]; for(n=1, 150, v=concat(v, if(isprime(n), floor(log(n)), ))); v

CROSSREFS

Cf. A029832, A029833, A053821, A062950.

Sequence in context: A197629 A198255 A290542 * A318715 A202385 A029833

Adjacent sequences:  A029831 A029832 A029833 * A029835 A029836 A029837

KEYWORD

nonn,easy

AUTHOR

N. J. A. Sloane.

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 18 16:40 EST 2019. Contains 319271 sequences. (Running on oeis4.)