

A037230


Numbers n such that phi(n) < pi(n).


1




OFFSET

1,1


COMMENTS

According to a note in Wacław Sierpiński's book "O stu prostych, ale trudnych zagadnieniach arytmetyki", a 1951 paper of L. Moser proves that 60 is the last term in the sequence.  Arkadiusz Wesolowski, Dec 22 2011 [A rough translation of the title of this book is "A hundred elementary but tough problems in arithmetic." No English translation appears to exist, but there are several later books by Sierpiński with similar titles that have been translated. I don't know if they give the Moser reference.  N. J. A. Sloane, Dec 26 2011]
Leo Moser proved in 1951 that these are the only terms.  Amiram Eldar, May 15 2017


LINKS

Table of n, a(n) for n=1..7.
Leo Moser, On the equation ϕ(n) = π(n), Pi Mu Epsilon Journal. Vol. 1, No. 5 (1951), pp. 177180.


MATHEMATICA

Select[Range[60], EulerPhi[#] < PrimePi[#] &] (* Arkadiusz Wesolowski, Dec 22 2011 *)


CROSSREFS

Cf. A037171.
Sequence in context: A028436 A184523 A246977 * A277723 A033018 A189781
Adjacent sequences: A037227 A037228 A037229 * A037231 A037232 A037233


KEYWORD

nonn,fini,full


AUTHOR

David W. Wilson


EXTENSIONS

Offset corrected by Arkadiusz Wesolowski, Dec 22 2011


STATUS

approved



