login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A228066 a(n) = A006879(n) - A228065(n). 6

%I #24 Feb 24 2023 09:57:44

%S 0,3,20,120,763,5210,38042,288616,2259818,18165437,149165130,

%T 1246782034,10576153259,90845450184,788766653816,6912684881941,

%U 61079444849535,543599336199608,4869141098476425,43865568875289741,397232678533509005,3614124134441452287

%N a(n) = A006879(n) - A228065(n).

%C Difference between the number of primes with n digits (A006879) and the difference of consecutive integers nearest to (10^n)/log(10^n) (see A228065).

%C The sequence A006879(n) is always > A228065(n) for 1 <= n <= 28.

%C The sequence (A228065) provides exactly the first value of pi(10^n)- pi(10^(n-1)) for n = 1, and yields an average relative difference in absolute value, i.e., average(abs(A228066(n))/(A006879(n))) = 0.0436296... for 1 <= n <= 28.

%C Note that A057834(n) = 10^n/log(10^n) is not defined for n = 0; its value is set arbitrarily to 0. - Updated by _Eduard Roure Perdices_, Apr 18 2021

%H Eduard Roure Perdices, <a href="/A228066/b228066.txt">Table of n, a(n) for n = 1..28</a>

%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/PrimeCountingFunction.html">Prime Counting Function</a>

%F a(n) = A006879(n) - A228065(n).

%Y Cf. A006880, A006879, A228065.

%K nonn,base,less

%O 1,2

%A _Vladimir Pletser_, Aug 06 2013

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 19 06:44 EDT 2024. Contains 371782 sequences. (Running on oeis4.)