|
%I #34 Jun 25 2022 01:00:32
%S 0,0,0,1,1,1,1,2,3,3,3,3,3,3,3,4,4,4,4,4,4,4,4,4,5,5,6,6,6,6,6,7,7,7,
%T 7,7,7,7,7,7,7,7,7,7,7,7,7,7,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,9,9,9,9,9,
%U 9,9,9,9,9,9,9,9,9,9,9,9,10,10,10,10,10,10,10,10,10,10,10,10,10,10
%N Number of prime powers <= n with exponents > 1.
%C Counts A025475 without 1 = prime^0: a(n) = A085501(n) - 1. - _Reinhard Zumkeller_, Jul 03 2003
%C Counts the prime powers (A246655) without the primes. - _Peter Luschny_, Nov 18 2019
%D H. Sahu, K. Kar and B.S.K.R. Somayajulu, On the average order of pi*(n) - pi(n), Acta Cienc. Indica Math., Vol. 11 (1985), pp. 165-168.
%D József Sándor, Dragoslav S. Mitrinovic and Borislav Crstici, Handbook of Number Theory I, Springer Science & Business Media, 2005, Chapter VII, p. 237.
%H Daniel Forgues, <a href="/A069637/b069637.txt">Table of n, a(n) for n=1..100000</a>.
%F a(n) = A025528(n) - A000720(n) = A000720([n^(1/2)]) + A000720([n^(1/3)]) + ... . - _Max Alekseyev_, May 11 2009
%F Sum_{k=1..n} a(k) ~ (4/3) * n^(3/2)/log(n) + O(n^(3/2)/log(n)^2) (Sahu et al., 1985). - _Amiram Eldar_, Mar 07 2021
%p with(numtheory);
%p A069637 := proc(N) local ct,i; ct:=0;
%p for i from 1 to N do if not isprime(i) and nops(factorset(i))=1 then ct:=ct+1; fi; od; ct; end; # _N. J. A. Sloane_, Jun 05 2022
%t Table[Sum[PrimePi[n^(1/k)], {k, Log[2, n]}]-PrimePi[n],{n,94}] (* _Stefano Spezia_, Jun 05 2022 *)
%o (SageMath)
%o [A025528(n) - prime_pi(n) for n in (1..100)] # _Peter Luschny_, Nov 18 2019
%Y Cf. A025528, A000720, A025475, A085501, A246655.
%Y Partial sums of A268340.
%K nonn
%O 1,8
%A _Amarnath Murthy_, Mar 27 2002
|
