OFFSET
1,2
EXAMPLE
For n = 3; a(3) = 30 because 30 is the smallest number with exactly 3 divisors d that sigma(d) is also its divisor, namely 1, 2 and 5 as sigma(1) = 1, sigma(2) = 3 and sigma(5) = 6, and all these (1, 3 and 6) are divisors of 30.
MATHEMATICA
f[n_] := Count[Divisors[n], _?(Divisible[n, DivisorSigma[1, #]] &)]; m = 42; s = Table[0, {m}]; c = 0; n = 1; While[c < m, v = f[n]; If[v <=m && s[[v]] == 0, c++; s[[v]] = n]; n++]; s (* Amiram Eldar, Aug 08 2019 *)
PROG
(Magma) A309253:=func<n|exists(r){m:m in[1..200000] | #[d: d in Divisors(m) | IsIntegral(m / SumOfDivisors(d))] eq n }select r else 0>; [A309253(n): n in[1..40]]
(PARI) a(n) = my(m=1); while(sumdiv(m, d, !(m%sigma(d))) != n, m++); m; \\ Jinyuan Wang, Aug 08 2019
CROSSREFS
KEYWORD
nonn
AUTHOR
Jaroslav Krizek, Aug 08 2019
STATUS
approved