OFFSET
1,1
LINKS
Amiram Eldar, Table of n, a(n) for n = 1..10000 (terms 1..1000 from Paolo P. Lava)
EXAMPLE
Aliquot divisors of 39 are 1, 3, 13. Then tau(sigma(1)) + tau(sigma(3)) + tau(sigma(13)) = 1 + 3 + 4 = 8 and tau(sigma(39)) = 8.
MAPLE
with(numtheory); P:=proc(q) local a, b, i, n;
for n from 1 to q do a:=divisors(n); b:=0;
for i from 1 to nops(a)-1 do b:=b+tau(sigma(a[i])); od;
if tau(sigma(n))=b then print(n); fi; od; end: P(10^6);
MATHEMATICA
q[n_] := DivisorSum[n, DivisorSigma[0, DivisorSigma[1, #]] &, # < n &] == DivisorSigma[0, DivisorSigma[1, n]]; Select[Range[2300], q] (* Amiram Eldar, Aug 22 2023 *)
PROG
(PARI) isok(n) = numdiv(sigma(n)) == sumdiv(n, d, (d<n)*numdiv(sigma(d))); \\ Michel Marcus, Mar 08 2014
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Paolo P. Lava, Mar 07 2014
STATUS
approved
