|
Search: id:A029834
|
|
|
| A029834 |
|
A discrete version of the Mangoldt function: if n is prime then floor(log(n)) else 0. |
|
+0
5
|
|
| 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; listen)
|
|
|
OFFSET
|
1,11
|
|
|
COMMENT
|
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.
|
|
PROGRAM
|
(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: A089800 A079208 A069851 this_sequence A029833 A050948 A062590
Adjacent sequences: A029831 A029832 A029833 this_sequence A029835 A029836 A029837
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
njas
|
|
|
Search completed in 0.002 seconds
|
