A037229 - OEIS

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

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A037229

n such that pi(n) >= phi(n).

2, 3, 4, 6, 8, 10, 12, 14, 18, 20, 24, 30, 42, 60, 90

(list; graph; refs; listen; history; text; internal format)

OFFSET

0,1

COMMENTS

It is known (see references) that, for n>15, phi(n)>n/(e^c*log(log(n))+3) and pi(n)<1.25506*n/log(n), where c is the Euler constant. Therefore, there are no terms, at least, for n satisfying the inequality: log(n)/(e^c*log(log(n))+3)>1.25506... So, for, e.g., n>=5500, there are no terms. Besides, by the direct verification, we find that interval (90,5500) contains no terms as well. - Vladimir Shevelev, Aug 27 2011

REFERENCES

N. E. Bach, J. Shallit, Algorithmic Number Theory, MIT Press, 233 (1996). ISBN 0-262-02405-5 (Theorem 8.8.7)

LINKS

Table of n, a(n) for n=0..14.

J. Barkley Rosser and Lowell Schoenfeld, Approximate formulas for some functions of prime numbers, Ill. Journ. Math. 6 (1962) 64-94.

CROSSREFS

Cf. A000010, A000720, A037171, A037228, A073464.

Sequence in context: A122957 A078769 A064375 * A351740 A230374 A007183

Adjacent sequences: A037226 A037227 A037228 * A037230 A037231 A037232

KEYWORD

nonn,fini,full

AUTHOR

David W. Wilson

STATUS

approved