A272231 - OEIS

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

A272231

a(n) = round(n / pi(n)), where pi(n) is the prime-counting function.

2, 2, 2, 2, 2, 2, 2, 2, 3, 2, 2, 2, 2, 3, 3, 2, 3, 2, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 4, 4, 4, 3, 4, 3, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4

(list; graph; refs; listen; history; text; internal format)

OFFSET

2,1

COMMENTS

This sequence grows slowly; a(n) reaches 10 at n = 39017.

LINKS

Table of n, a(n) for n=2..99.

FORMULA

a(n) = round(n / pi(n)).

a(n) ~ log(n). - Charles R Greathouse IV, Apr 30 2016

MATHEMATICA

Table[Round[n/PrimePi@ n], {n, 2, 120}] (* Michael De Vlieger, May 20 2016 *)