login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A272231 a(n) = round(n / pi(n)), where pi(n) is the prime-counting function. 0
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 *)

PROG

(PARI) n \/ primepi(n) \\ Charles R Greathouse IV, Apr 30 2016

CROSSREFS

Cf. A000720, A064658.

Sequence in context: A100801 A194310 A306227 * A209253 A165113 A069903

Adjacent sequences:  A272228 A272229 A272230 * A272232 A272233 A272234

KEYWORD

nonn,changed

AUTHOR

Benjamin Przybocki, Apr 22 2016

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 29 15:44 EDT 2020. Contains 334704 sequences. (Running on oeis4.)