|
| |
|
|
A037230
|
|
Numbers n such that phi(n) < pi(n).
|
|
0
| | |
|
|
|
OFFSET
| 1,1
|
|
|
COMMENTS
| According to a note in Waclaw Sierpinski'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 Sierpinski with similar titles that have been translated. I don't know if they give the Moser reference. - N. J. A. Sloane, Dec 26 2011]
|
|
|
MATHEMATICA
| Select[Range[60], EulerPhi[#] < PrimePi[#] &] (* Arkadiusz Wesolowski, Dec 22 2011 *)
|
|
|
CROSSREFS
| Sequence in context: A043369 A028436 A184523 * A033018 A189781 A033845
Adjacent sequences: A037227 A037228 A037229 * A037231 A037232 A037233
|
|
|
KEYWORD
| nonn,fini,full
|
|
|
AUTHOR
| David W. Wilson (davidwwilson(AT)comcast.net)
|
|
|
EXTENSIONS
| Offset corrected by Arkadiusz Wesolowski, Dec 22 2011
|
| |
|
|
