OFFSET
1,1
COMMENTS
Equivalently, numbers k such that totient(k) <= cototient(k).
Using the primes up to 23 it is possible to show that this sequence has (lower) density greater than 0.51. - Charles R Greathouse IV, Oct 26 2015
The asymptotic density of this sequence is in the interval (0.51120, 0.51176) (Kobayashi, 2016, improving the bounds 0.5105 and 0.5241 that were given by Wall, 1972). - Amiram Eldar, Oct 15 2020
LINKS
Amiram Eldar, Table of n, a(n) for n = 1..10000
Mitsuo Kobayashi, A generalization of a series for the density of abundant numbers, International Journal of Number Theory, Vol. 12, No. 3 (2016), pp. 671-677.
Charles R. Wall, Density bounds for Euler's function, Mathematics of Computation, Vol. 26, No. 119 (1972), pp. 779-783.
FORMULA
Elements of A054741 together with all 2^n for n>0.
MATHEMATICA
Select[Range[130], 2*EulerPhi[#] <= # &] (* Amiram Eldar, Feb 29 2020 *)
PROG
(PARI) is(n)=2*eulerphi(n)<=n \\ Charles R Greathouse IV, Oct 26 2015
CROSSREFS
KEYWORD
nonn
AUTHOR
Franklin T. Adams-Watters, May 19 2006
STATUS
approved