%I #10 Jan 08 2021 10:53:33
%S 0,0,1,2,4,8,10,20,12,20,24,40,34,35,52,70,72,56,95,84,112,48,104,130,
%T 84,156,164,168,116,180,212,120,238,280,240,224,284,189,322,165,304,
%U 344,258,300,438,330,380,420,348,464,220,500,477,160,472,460,644,440,592
%N a(n) = A318366(A025487(n)).
%C A318366(n) computes a sum over the divisors of n in such a way that A318366(n) only depends on the prime signature of n. A025487 lists least numbers with a given prime signature with the exponents in nonincreasing order. This sequence hence shows this sum over divisors for distinct prime signatures.
%H David A. Corneth, <a href="/A322375/b322375.txt">Table of n, a(n) for n = 1..24112</a>
%e a(8) = A318366(A025487(8)) = A318366(24) = 20 (See example of finding A318366 at that sequence).
%Y Cf. A025487, A318366.
%K nonn
%O 1,4
%A _David A. Corneth_, Jan 12 2019
|