Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #14 Aug 31 2023 05:31:53
%S 1,6,15,36,45,90,91,200,207,270,231,540,325,546,675,1040,561,1242,703,
%T 1620,1365,1386,1035,3000,1725,1950,2565,3276,1653,4050,1891,5152,
%U 3465,3366,4095,7452,2701,4218,4875,9000,3321,8190,3655,8316,9315,6210,4371,15600
%N a(n) = n * A062949(n).
%H Amiram Eldar, <a href="/A127469/b127469.txt">Table of n, a(n) for n = 1..10000</a>
%F a(n) = n * A062949(n).
%F Multiplicative with a(p^e) = ((e+1)*p^(2*e+1) - (e+2)*p^(2*e) + p^e)/(p-1). - _Amiram Eldar_, Aug 31 2023
%e a(5) = 45 = 5 * A062949(5) = 5 * 9.
%p A127469 := proc(n) n*A062949(n) ; end proc:
%p seq(A127469(n),n=1..80) ; # _R. J. Mathar_, Feb 09 2011
%t f[p_, e_] := ((e+1)*p^(e+1)-(e+2)*p^e+1)/(p-1); a[1] = 1; a[n_] := n * Times @@ f @@@ FactorInteger[n]; Array[a, 60] (* _Amiram Eldar_, Aug 31 2023 *)
%Y Cf. A062949.
%Y Row sums of triangle A127470.
%K nonn,easy,mult
%O 1,2
%A _Gary W. Adamson_, Jan 15 2007
%E More terms from _Amiram Eldar_, Aug 31 2023