login
A349763
Numbers k such that d(k) = A000005(k), sigma(k) = A000203(k) and phi(k) = A000010(k) are all deficient numbers (A005100).
1
1, 2, 3, 4, 8, 16, 48, 64, 121, 128, 192, 256, 512, 529, 1024, 2116, 2209, 2809, 3072, 3481, 4096, 6889, 8192, 8836, 11449, 12288, 13924, 14641, 16384, 17161, 18769, 22201, 27556, 27889, 29282, 29929, 32041, 32768, 36481, 45796, 51529, 54289, 57121, 63001, 65536
OFFSET
1,2
COMMENTS
Sándor (2005) proved that this sequence is infinite by showing that any number of the form 2^(p-1), where p is a sufficiently large prime, is a term. d(2^(p-1)) = p and phi(2^(p-1)) = 2^(p-2) are deficient for all primes, while sigma(2^(p-1)) = 2^p - 1 is deficient for a sufficiently large prime, a result of a theorem by Bojanić (1954): lim_{p prime -> oo} sigma(2^p - 1)/(2^p - 1) = 1.
REFERENCES
R. Bojanić, Asymptotic evaluations of the sum of divisors of certain numbers (in Serbo-Croatian), Bull. Soc. Math.-Phys. R. P. Macédoine, Vol. 5 (1954), pp. 5-15.
LINKS
EXAMPLE
2 is a term since d(2) = 2, sigma(2) = 3 and phi(2) = 1 are all deficient numbers.
MATHEMATICA
defQ[n_] := DivisorSigma[1, n] < 2*n; q[n_] := And @@ defQ /@ Join[DivisorSigma[{0, 1}, n], {EulerPhi[n]}]; Select[Range[10^5], q]
PROG
(PARI) isdef(k) = sigma(k) < 2*k;
isok(k) = my(f=factor(k)); isdef(numdiv(f)) && isdef(sigma(f)) && isdef(eulerphi(k)); \\ Michel Marcus, Dec 01 2021
CROSSREFS
Subsequence of A349759.
Sequence in context: A162724 A244750 A140974 * A360000 A372100 A296109
KEYWORD
nonn
AUTHOR
Amiram Eldar, Nov 29 2021
STATUS
approved