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”).

A215260
Nearest integer to log(A002110(n)).
4
0, 1, 2, 3, 5, 8, 10, 13, 16, 19, 23, 26, 30, 33, 37, 41, 45, 49, 53, 57, 62, 66, 70, 75, 79, 84, 88, 93, 98, 102, 107, 112, 117, 122, 127, 132, 137, 142, 147, 152, 157, 162, 167, 173, 178, 183, 189, 194, 199, 205, 210, 216, 221, 227, 232, 238, 243, 249, 254, 260, 266, 271, 277, 283, 288, 294, 300, 306, 312, 317, 323, 329, 335, 341, 347, 353, 359, 365, 371, 377
OFFSET
0,3
LINKS
Charles R Greathouse IV, Table of n, a(n) for n = 0..10000
FORMULA
a(n) ~ n log n, a statement equivalent to the Prime Number Theorem. - Charles R Greathouse IV, Sep 23 2012
MATHEMATICA
Round@ Log@ FoldList[ Times, 1, Prime@ Range@ 60] (* Robert G. Wilson v, Sep 16 2015 *)
PROG
(PARI) v=List([t=0]); forprime(p=2, 200, t+=log(p); listput(v, round(t))); Vec(v) \\ Charles R Greathouse IV, Sep 23 2012
CROSSREFS
KEYWORD
nonn
AUTHOR
N. J. A. Sloane, Sep 14 2012
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