cp's OEIS Frontend

A198286 a(n) = Sum_{d|n} (A053143(d) or smallest square divisible by d).

%I A198286 #23 Sep 05 2020 07:46:34
%S A198286 1,5,10,9,26,50,50,25,19,130,122,90,170,250,260,41,290,95,362,234,500,
%T A198286 610,530,250,51,850,100,450,842,1300,962,105,1220,1450,1300,171,1370,
%U A198286 1810,1700,650,1682,2500,1850,1098,494,2650,2210,410,99,255,2900,1530,2810
%N A198286 a(n) = Sum_{d|n} (A053143(d) or smallest square divisible by d).
%C A198286 Multiplicative function with a(p^e) = 1+2*(p^(e+2)-p^2)/(p^2-1) if e is even else a(p^e)=(1+p^2)((p^(e+1)-1)/(p^2-1)). Examples: a(9)=a(3^2)=1+2*((81-9)/(9-1))=1+2*9=19; a(8)=a(2^3)=(1+4)((16-1)/(4-1))=5*5=25.
%C A198286 Another definition of a(n): Sum_{d|n} (d*core(d)), where core(d) is the squarefree part of d (A007913), i.e., inverse Mobius transform of A053143.
%H A198286 Amiram Eldar, <a href="/A198286/b198286.txt">Table of n, a(n) for n = 1..10000</a>
%F A198286 Dirichlet g.f.: zeta(s)*zeta(s-2)*zeta(2s-2)/zeta(2s-4). - _R. J. Mathar_, Mar 12 2012
%F A198286 Sum_{k=1..n} a(k) ~ Pi^2 * Zeta(3) * n^3 / 45. - _Vaclav Kotesovec_, Feb 02 2019
%e A198286 a(18) = 95 because 18=2*3^2, so a(18) = (1+4)(1+9+9) = 5*19 = 95.
%e A198286 a(20) = 234 because 20=2^2*5, so a(20) = (1+4+4)(1+25) = 9*26 = 234.
%t A198286 ssq[n_] := For[k=1, True, k++, If[ Divisible[s = k^2, n], Return[s]]]; a[n_] := Sum[ ssq[d], {d, Divisors[n]}]; Table[a[n], {n, 1, 53}] (* _Jean-François Alcover_, Sep 03 2012 *)
%t A198286 f[p_, e_] := If[OddQ[e], (1+p^2)((p^(e+1)-1)/(p^2-1)), 1+2*(p^(e+2)-p^2)/(p^2-1)]; a[1] = 1; a[n_] := Times @@ (f @@@ FactorInteger[n]); Array[a, 53] (* _Amiram Eldar_, Sep 05 2020 *)
%o A198286 (PARI) a(n)=sumdiv(n,d,d*core(d)) \\ _Charles R Greathouse IV_, Oct 30 2011
%Y A198286 Similar to A068976 (sum of square part of d) and A069088  (sum of squarefree part of d).
%Y A198286 Cf. A007913, A053143.
%K A198286 nonn,mult
%O A198286 1,2
%A A198286 _Antonio Roldán_, Oct 23 2011