Amiram Eldar, <a href="/A113468/b113468_1.txt">Table of n, a(n) for n = 1..10000</a>
Amiram Eldar, <a href="/A113468/b113468_1.txt">Table of n, a(n) for n = 1..10000</a>
reviewed
approved
proposed
reviewed
editing
proposed
a(19) = 8 because 8, 8 + 19 = 27, 8 + 2*19 = 46 and 8 + 3*19 = 65 each have 4 divisors.
a[n_] := Module[{k = 1, d}, While[(d = DivisorSigma[0, k]) != DivisorSigma[0, k+n] || DivisorSigma[0, k+2*n] != d || DivisorSigma[0, k+3*n] != d, k++]; k]; Array[a, 60] (* Amiram Eldar, Aug 04 2024 *)
(PARI) a(n) = {my(k = 1, d); while((d = numdiv(k)) != numdiv(k+n) || numdiv(k+2*n) != d || numdiv(k+3*n) != d, k++); k; } \\ Amiram Eldar, Aug 04 2024
Least number k such that n, k, k+n+, k, +2*n+2k and k+3*n+3k have the same number of divisors.
Name corrected by Amiram Eldar, Aug 04 2024
Amiram Eldar, <a href="/A113468/b113468_1.txt">Table of n, a(n) for n = 1..10000</a>
approved
editing
_David Wasserman (dwasserm(AT)earthlink.net), _, Jan 08 2006
Least k such that n, n+k, n+2k, and n+3k have the same number of divisors.
a(19) = 8 because 8, 27, 46, and 65 each have 4 divisors.
nonn,new
nonn