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 #15 Jul 15 2023 05:54:06
%S 1,2,3,4,10,6,7,8,9,20,11,12,13,14,30,16,17,18,19,40,21,22,23,24,75,
%T 26,27,28,29,60,31,32,33,34,70,36,37,38,39,80,41,42,43,44,90,46,47,48,
%U 49,150,51,52,53,54,110,56,57,58,59,120,61,62,63,64,130,66,67,68,69,140,71,72,73,74,225
%N Expansion of Sum_{k>=0} 5^k * x^(5^k) / (1 - x^(5^k))^2.
%F a(n) = n * A055457(n).
%F If n == 0 (mod 5), a(n) = n + 5 * a(n/5) otherwise a(n) = n.
%F From _Amiram Eldar_, Jul 14 2023: (Start)
%F Multiplicative with a(5^e) = (e+1)*5^e and a(p^e) = p*e if p != 5.
%F Dirichlet g.f.: (5^s/(5^s-5)) * zeta(s-1).
%F Sum_{k=1..n} a(k) ~ (5/8)*n^2. (End)
%t a[n_] := n * (IntegerExponent[n, 5] + 1); Array[a, 100] (* _Amiram Eldar_, Jul 14 2023 *)
%o (PARI) a(n) = n*(valuation(n, 5)+1);
%Y Cf. A055457, A112765, A359100.
%Y Cf. A091512, A364222, A364224.
%K nonn,easy,mult
%O 1,2
%A _Seiichi Manyama_, Jul 14 2023