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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A135325 Smallest n such that pi(n)=Floor[n/log((n-pi(n))/e)]. 0
59473, 59671, 59699, 59707, 59729, 59743, 59747, 59755, 59771, 59779, 59791, 59799, 59810, 152993, 153001, 155801, 155809, 155821, 155833, 155849, 155853, 155877, 155889, 155913, 155925, 210533, 211891, 211933, 211943, 211949, 211969 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
Eric Weisstein's World of Mathematics, Prime Number Theorem.
MATHEMATICA
j=0; Do[k=Floor[n/Log[(n-PrimePi[n])/E]]; If[PrimePi[n]==k&&k>j, Print[n]; j=k], {n, 1, 10^7, 1}]
CROSSREFS
Sequence in context: A333056 A224972 A104919 * A031685 A238077 A344358
KEYWORD
nonn
AUTHOR
Manuel Valdivia, Dec 07 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 19 21:09 EDT 2024. Contains 371798 sequences. (Running on oeis4.)