OFFSET
0,1
COMMENTS
PrimePi(n) = A000720(n) => (log n)/(2 log 2) for all n > 2. An elegant proof is given in Kontoyiannis.
Base 4 logarithm of the natural logarithm base. - Alonso del Arte, Aug 31 2014
REFERENCES
Steven R. Finch, Mathematical Constants, Cambridge University Press, 2003, Section 5.7 Lengyel's constant p. 319 and Section 5.11 Feller's coin tossing p. 341.
LINKS
Ioannis Kontoyiannis, Some information-theoretic computations related to the distribution of prime numbers, arXiv:0710.4076 [cs.IT], 2007.
EXAMPLE
0.7213475204444817036799623405009460...
MAPLE
Digits:=100: evalf(0.5/log(2)); # R. J. Mathar, Nov 09 2007
MATHEMATICA
RealDigits[1/(2Log[2]), 10, 128][[1]] (* Alonso del Arte, Aug 31 2014 *)
PROG
(PARI) 1/log(4) \\ Charles R Greathouse IV, Mar 24 2016
CROSSREFS
KEYWORD
AUTHOR
Jonathan Vos Post, Oct 26 2007
EXTENSIONS
More terms from R. J. Mathar, Nov 09 2007
STATUS
approved