OFFSET
1,5
COMMENTS
The old entry with this sequence number was a duplicate of A002325.
REFERENCES
G. H. Hardy and E. M. Wright, An Introduction to the Theory of Numbers, 5th ed., Oxford Univ. Press, 1979, see Chap. 22.
D. S. Mitrinovic et al., Handbook of Number Theory, Kluwer, Section VII.35. (For inequalities, etc.)
LINKS
Ruud H.G. van Tol, Table of n, a(n) for n = 1..10000
J. Barkley Rosser and Lowell Schoenfeld, Approximate formulas for some functions of prime numbers, Ill. Journ. Math. 6 (1962) 64-94.
J. Barkley Rosser and Lowell Schoenfeld, Approximate formulas for some functions of prime numbers (scan of some key pages from an ancient annotated photocopy)
J. Barkley Rosser and Lowell Schoenfeld, Sharper bounds for the Chebyshev functions theta(x) and psi(x), Collection of articles dedicated to Derrick Henry Lehmer on the occasion of his seventieth birthday. Math. Comp. 29 (1975), 243-269.
J. Barkley Rosser and Lowell Schoenfeld, Sharper bounds for the Chebyshev functions theta (x) and psi (x). II. Math. Comp. 30 (1976), number 134, 337-360.
J. Barkley Rosser and Lowell Schoenfeld, Corrigendum: "Sharper bounds for the Chebyshev functions theta (x) and psi (x). II" (Math. Comput. 30 (1976), number 134, 337-360), Math. Comp. 30 (1976), number 136, 900.
zetamath, Factorials, prime numbers, and the Riemann Hypothesis, YouTube video, 2020.
FORMULA
a(n) ~ n by the prime number theorem. - Charles R Greathouse IV, Aug 02 2012
MAPLE
PROG
(PARI) a(n)= log(vecprod(primes([1, n])))\1; \\ Ruud H.G. van Tol, May 16 2026
(PARI) first(nn)= my(p=1, r, t=1); vector(nn, n, if(p==n, r=log(t*=p)\1; p=nextprime(p+1)); r); \\ Ruud H.G. van Tol, May 16 2026
CROSSREFS
KEYWORD
nonn,easy,changed
AUTHOR
N. J. A. Sloane, Oct 02 2008
STATUS
approved
