|
%I #19 Nov 19 2021 14:09:17
%S 1,5,6,15,8,32,10,37,23,42,14,100,16,52,52,83,20,125,22,132,64,72,26,
%T 252,45,82,76,162,32,286,34,177,88,102,88,397,40,112,100,336,44,352,
%U 46,222,208,132,50,572,75,239,124,252,56,416,120,414,136,162,62,916,64
%N a(n) = Sum_{i|n, j|n} min(i,j).
%H Antti Karttunen, <a href="/A064949/b064949.txt">Table of n, a(n) for n = 1..20000</a> (first 1000 terms from Harry J. Smith)
%F a(n) = Sum_{i=1..tau(n)} (2*tau(n)-2*i+1)*d_i, where {d_i}, i=1..tau(n), is increasing sequence of divisors of n.
%F a(n) = Sum_{i=1..n} A135539(n,i)^2. - _Ridouane Oudra_, Oct 25 2021
%e a(6) = dot_product(7,5,3,1)*(1,2,3,6) = 7*1 + 5*2 + 3*3 + 1*6 = 32.
%p with(numtheory): seq(add((2*tau(n)-2*i+1)*sort(convert(divisors(n),'list'))[i],i=1..tau(n)), n=1..200);
%t Array[Function[{t, d}, Total@ MapIndexed[#1 (2 t - 2 First[#2] + 1) &, d]] @@ {DivisorSigma[0, #], Divisors[#]} &, 61] (* _Michael De Vlieger_, Oct 25 2021 *)
%o (PARI) { for (n=1, 1000, d=divisors(n); t=length(d); a=sum(i=1, t, (2*t - 2*i + 1)*d[i]); write("b064949.txt", n, " ", a) ) } \\ _Harry J. Smith_, Oct 01 2009
%o (PARI) A064949(n) = { my(i=0, u=numdiv(n)); sumdiv(n,d,i++; (((2*u)-(2*i))+1)*d); }; \\ _Antti Karttunen_, Nov 14 2021
%Y Cf. A000005, A000203.
%Y Cf. A135539.
%K nonn
%O 1,2
%A _Vladeta Jovovic_, Oct 28 2001
|
