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!)
A127267 a(n) = floor(n/pi(n)), where pi(n)=A000720(n) is the number of primes <=n. 0
2, 1, 2, 1, 2, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 3, 2, 3, 2, 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, 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, 3, 3, 3, 4, 3, 3, 3, 3, 3, 3 (list; graph; refs; listen; history; text; internal format)
OFFSET

2,1

LINKS

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

FORMULA

a(n) = A097456(n) + 1. - Filip Zaludek, Dec 16 2016

EXAMPLE

a(28)=3 because there are 9 primes not exceeding 28 (namely, 2,3,5,7,11,13,17,19,23) and floor(28/9)=3.

MAPLE

with(numtheory): a:=n->floor(n/pi(n)): seq(a(n), n=2..140); # Emeric Deutsch, Apr 15 2007

MATHEMATICA

Table[Floor[n/PrimePi@ n], {n, 2, 120}] (* Michael De Vlieger, Dec 17 2016 *)

PROG

(PARI) a(n) = n\primepi(n); \\ Michel Marcus, Dec 16 2016

CROSSREFS

Cf. A000720.

Sequence in context: A033831 A033105 A106703 * A268173 A008617 A025824

Adjacent sequences:  A127264 A127265 A127266 * A127268 A127269 A127270

KEYWORD

nonn

AUTHOR

Leroy Quet, Mar 27 2007

EXTENSIONS

More terms from Emeric Deutsch, Apr 15 2007

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 February 25 22:25 EST 2020. Contains 332265 sequences. (Running on oeis4.)