|
%I #16 Mar 27 2024 08:59:50
%S 1,2,2,3,2,3,2,4,3,3,2,5,2,3,3,5,2,5,2,5,3,3,2,6,3,3,4,5,2,4,2,6,3,3,
%T 3,6,2,3,3,6,2,4,2,5,5,3,2,8,3,5,3,5,2,6,3,6,3,3,2,7,2,3,5,7,3,4,2,5,
%U 3,4,2,8,2,3,5,5,3,4,2,8,5,3,2,7,3,3,3,6,2,7,3,5,3,3,3,9,2,5,5,6,2,4,2,6
%N Number of different values of A000005(d) where d is a divisor of n.
%H Antti Karttunen, <a href="/A088873/b088873.txt">Table of n, a(n) for n = 1..10000</a>
%t a[n_] := Length@ DeleteDuplicates[DivisorSigma[0, Divisors[n]]]; Array[a, 100] (* _Amiram Eldar_, Mar 27 2024 *)
%o (PARI) a(n) = {vals = Set(); fordiv(n, d, vals = Set(concat(vals, numdiv(d)))); return (length(vals));} \\ _Michel Marcus_, Jul 14 2013
%Y Cf. A000005.
%Y Differs from A085082 and A181796 for the first time at n=24, where a(24) = 6, while A085082(24) = A181796(24) = 7.
%K easy,nonn
%O 1,2
%A _Naohiro Nomoto_, Nov 30 2003
|
