login

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”).

Numbers for which phi(n) >= phi(k) for all k = 1 to n-1.
3

%I #12 Sep 17 2024 12:34:38

%S 1,2,3,4,5,7,9,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,

%T 83,89,97,101,103,107,109,113,127,131,137,139,149,151,157,163,167,173,

%U 179,181,191,193,197,199,211,223,227,229,233,239,241,251,257,263,269

%N Numbers for which phi(n) >= phi(k) for all k = 1 to n-1.

%C Conjecture: 4 and 9 are the only composite terms.

%C No more composite terms below 1.5e18. Such a term would require a prime gap greater than sqrt(p); in the absence of such large gaps, a(n) = prime(n-2) for n > 6. - _Charles R Greathouse IV_, Apr 12 2010

%e 4 is a term as phi(4)=2 and phi(1), phi(2), phi(3) are <= 2. 16 is not a term as phi(16) < phi(11).

%K easy,nonn

%O 1,2

%A _Amarnath Murthy_, Jan 09 2002

%E Offset changed by _Andrew Howroyd_, Sep 17 2024