login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A057872
A version of the Chebyshev function theta(n): a(n) = round(Sum_{primes p <= n } log(p)).
6
0, 0, 1, 2, 2, 3, 3, 5, 5, 5, 5, 8, 8, 10, 10, 10, 10, 13, 13, 16, 16, 16, 16, 19, 19, 19, 19, 19, 19, 23, 23, 26, 26, 26, 26, 26, 26, 30, 30, 30, 30, 33, 33, 37, 37, 37, 37, 41, 41, 41, 41, 41, 41, 45, 45, 45, 45, 45, 45, 49, 49, 53, 53, 53, 53, 53, 53, 57, 57, 57, 57, 62, 62, 66, 66, 66, 66
OFFSET
0,4
COMMENTS
See A035158, which is the main entry for this function.
The old entry with this sequence number was a duplicate of A053632.
REFERENCES
G. H. Hardy and E. M. Wright, An Introduction to the Theory of Numbers. 3rd ed., Oxford Univ. Press, 1954, p. 340.
D. S. Mitrinovic et al., Handbook of Number Theory, Kluwer, Section VII.35, p. 267.
LINKS
Charles R Greathouse IV, Table of n, a(n) for n = 0..10000
FORMULA
theta(n) = log(A034386(n)).
a(n) ~ n, a statement equivalent to the Prime Number Theorem. - Charles R Greathouse IV, Sep 23 2012
PROG
(PARI) v=List(); t=0; for(n=0, 100, if(isprime(n), t+=log(n)); listput(v, round(t))); Vec(v) \\ Charles R Greathouse IV, Sep 23 2012
CROSSREFS
KEYWORD
nonn
AUTHOR
N. J. A. Sloane, Oct 02 2008
STATUS
approved

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy