|
%I #15 Feb 06 2019 17:18:23
%S 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,
%T 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,
%U 0,0,4,0,4,0,0,0,0,0,4,0,0,0,4,0,0,0,0,0,4,0,0,0,0,0,0,0,4,0,0,0,4,0,4,0,0,0,4,0,4,0,0,0,4,0,0
%N A discrete version of the Mangoldt function: if n is prime then floor(log(n)) else 0.
%C The real Mangoldt function Lambda(n) is equal to log(n) if n is prime else 0.
%D T. M. Apostol, Introduction to Analytic Number Theory, Springer-Verlag, 1976, page 32.
%D Paulo Ribenboim, Algebraic Numbers, p. 44.
%H Antti Karttunen, <a href="/A029834/b029834.txt">Table of n, a(n) for n = 1..65539</a>
%t Array[If[PrimeQ[#], Floor[Log[#]], 0] &, 80] (* _Harvey P. Dale_, Jul 24 2013 *)
%o (PARI) v=[]; for(n=1,150,v=concat(v, if(isprime(n),floor(log(n)),))); v
%o (PARI) A029834(n) = if(!isprime(n),0,floor(log(n))); \\ _Antti Karttunen_, Feb 06 2019
%Y Cf. A029832, A029833, A053821, A062950.
%K nonn,easy
%O 1,11
%A _N. J. A. Sloane_.
%E More terms from _Antti Karttunen_, Feb 06 2019
|
