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!)
A067126 Numbers for which phi(n) >= phi(k) for all k = 1 to n-1. 3

%I #6 Nov 05 2015 10:59:23

%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 member as phi(4)=2 and phi(1), phi(2), phi(3) are <= 2. 16 is not a member as phi(16) < phi(11).

%K easy,nonn

%O 0,2

%A _Amarnath Murthy_, Jan 09 2002

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 18 22:18 EDT 2024. Contains 371782 sequences. (Running on oeis4.)