|
| |
|
|
A029832
|
|
A discrete version of the Mangoldt function: if n is prime then ceiling(log(n)) else 0.
|
|
3
| |
|
|
0, 1, 2, 0, 2, 0, 2, 0, 0, 0, 3, 0, 3, 0, 0, 0, 3, 0, 3, 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, 4, 0, 0, 0, 0, 0, 4, 0, 0, 0, 0, 0, 5, 0, 5, 0, 0, 0, 0, 0, 5, 0, 0, 0, 5, 0, 5, 0, 0, 0, 0, 0, 5, 0
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,3
|
|
|
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. A029833, A029834, A053821.
Sequence in context: A179212 A105118 A103271 * A174479 A172444 A026611
Adjacent sequences: A029829 A029830 A029831 * A029833 A029834 A029835
|
|
|
KEYWORD
| nonn,easy
|
|
|
AUTHOR
| N. J. A. Sloane (njas(AT)research.att.com).
|
| |
|
|
