login
This site is supported by donations to The OEIS 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; internal format)
OFFSET

2,1

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 (deutsch(AT)duke.poly.edu), Apr 15 2007

CROSSREFS

Cf. A000720.

Sequence in context: A033831 A033105 A106703 * A008617 A025824 A161232

Adjacent sequences:  A127264 A127265 A127266 * A127268 A127269 A127270

KEYWORD

nonn

AUTHOR

Leroy Quet, Mar 27 2007

EXTENSIONS

More terms from Emeric Deutsch (deutsch(AT)duke.poly.edu), Apr 15 2007

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 14 19:37 EST 2012. Contains 205663 sequences.