A336612 -id:A336612 - cp's OEIS frontend

A336613 Numbers m such that tau(sigma(m)) divides m, where tau(m) is the number of divisors function (A000005) and sigma(m) is the sum of divisors function (A000203).

1, 2, 3, 4, 6, 8, 12, 16, 24, 36, 48, 64, 72, 80, 81, 84, 100, 112, 120, 128, 140, 144, 156, 160, 162, 168, 192, 198, 200, 208, 210, 216, 240, 256, 270, 288, 300, 320, 324, 336, 357, 360, 368, 384, 390, 420, 432, 448, 464, 468, 480, 512, 560, 576, 592, 600, 624, 630

Offset: 1

Bernard Schott, Jul 29 2020

nonn

Two subsets of terms:
1) If 2^p - 1 is a Mersenne prime (p is in A000043 and 2^p-1 is in A000668), then m = 2^(p-1) is a term that belongs to A019279: the even superperfect numbers (2, 4, 16, 64, 4096, ...). Proof: sigma(m) = 1+2+...+2^(p-1) = 2^p - 1 that is a Mersenne prime so tau(2^p-1) = 2 that divides m = 2^(p-1); indeed, m/tau(sigma(m)) = 2^(p-2).
2) If m = 2^(p-1) is a term as above, then 3*m is another term (see example) with 3*m/tau(sigma(3*m)) = 2^(p-2).

			48 = 2^4 * 3, so, sigma(48) = sigma(2^4) * sigma(3) = (2^5 - 1) * (1+3) = 31 * 4 = 124; then, tau(2^2 * 31) = tau(4) * tau(31) = 3 * 2 = 6, and  48/6 = 8 = 2^3, hence 48 is a term.

Cf. A000005, A000203, A062068.

Cf. A019279 (subsequence), A336612 (sigma(tau(m)) divides m).

with(numtheory) filter:= m -> m/tau(sigma(m)) = floor(m/tau(sigma(m))) : select(filter, [$1..650]);

Select[Range[630], Divisible[#, DivisorSigma[0, DivisorSigma[1, #]]] &] (* Amiram Eldar, Jul 30 2020 *)

isok(m) = !(m % numdiv(sigma(m))); \\ Michel Marcus, Jul 30 2020

A336687 Numbers m such that tau(sigma(m)) and sigma(tau(m)) both divide m, where tau(m) is the number of divisors function (A000005) and sigma(m) is the sum of divisors function (A000203).

Original entry on oeis.org

1, 3, 4, 12, 64, 84, 140, 144, 162, 192, 336, 360, 420, 468, 480, 576, 600, 644, 720, 780, 1008, 1344, 1512, 1584, 1600, 1740, 1872, 2160, 2240, 2448, 2592, 2736, 2880, 2884, 3136, 3240, 3888, 4032, 4158, 4228, 4464, 4608, 4800, 5040, 5115, 5184, 5328, 5670, 6060, 6192, 6336

Offset: 1

Bernard Schott, Jul 31 2020

nonn

Conjecture: The only m such that m = tau(sigma(m))*sigma(tau(m)) are in {1,468,3240}. Verified for m up to 1*10^9. - Ivan N. Ianakiev, Aug 06 2020

			For 84: tau(84) = 12 and sigma(12) = 28 with 84/28 = 3. Also, sigma(84) = 224 and tau(224) = 12 with 84/12 = 7. Hence, 84 is a term.

Cf. A000005, A000203, A062068, A062069.

Intersection of A336612 and A336613.

with(numtheory):
filter:= m-> irem(m, tau(sigma(m)))=0 and irem(m, sigma(tau(m)))=0:
select(filter, [$1..7000])[];

Select[Range[6400], And @@ Divisible[#, {DivisorSigma[0, DivisorSigma[1, #]], DivisorSigma[1, DivisorSigma[0, #]]}] &] (* Amiram Eldar, Jul 31 2020 *)

isok(m) = !(m % numdiv(sigma(m))) && !(m % sigma(numdiv(m))); \\ Michel Marcus, Aug 02 2020

cp's OEIS Frontend

A336613 Numbers m such that tau(sigma(m)) divides m, where tau(m) is the number of divisors function (A000005) and sigma(m) is the sum of divisors function (A000203).

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Maple

Mathematica

PARI