|
Search: id:A127267
|
|
|
| A127267 |
|
a(n)=floor(n/pi(n)), where pi(n)=A000720(n) is the number of primes <=n. |
|
+0
1
|
|
| 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; listen)
|
|
|
OFFSET
|
2,1
|
|
|
LINKS
|
Leroy Quet, Home Page (listed in lieu of email address)
|
|
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 this_sequence A008617 A025824 A161232
Adjacent sequences: A127264 A127265 A127266 this_sequence 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
|
|
|
Search completed in 0.002 seconds
|
