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 #10 Sep 04 2016 18:47:01
%S 0,1,9,36,100,101,109,136,200,325,333,360,424,549,765,792,856,981,
%T 1197,1540,1604,1729,1945,2288,2800,2801,2809,2836,2900,3025,3033,
%U 3060,3124,3249,3465,3492,3556,3681,3897,4240,4304,4429,4645,4988,5500,5625,5841,6184,6696,7425,7433,7460,7524,7649,7865,7892,7956,8081,8297,8640,8704,8829,9045,9388,9900,10025
%N a(n) = Sum_{i=0..n} digsum_5(i)^3, where digsum_5(i) = A053824(i).
%D Grabner, P. J.; Kirschenhofer, P.; Prodinger, H.; Tichy, R. F.; On the moments of the sum-of-digits function. Applications of Fibonacci numbers, Vol. 5 (St. Andrews, 1992), 263-271, Kluwer Acad. Publ., Dordrecht, 1993.
%H Vincenzo Librandi, <a href="/A231670/b231670.txt">Table of n, a(n) for n = 0..1000</a>
%H J. Coquet, <a href="http://dx.doi.org/10.1016/0022-314X(86)90067-3">Power sums of digital sums</a>, J. Number Theory 22 (1986), no. 2, 161-176.
%H J.-L. Mauclaire and Leo Murata, <a href="http://dx.doi.org/10.3792/pjaa.59.274">On q-additive functions</a>, I. Proc. Japan Acad. Ser. A Math. Sci. 59 (1983), no. 6, 274-276.
%H J.-L. Mauclaire and Leo Murata, <a href="http://dx.doi.org/10.3792/pjaa.59.441">On q-additive functions</a>, II. Proc. Japan Acad. Ser. A Math. Sci. 59 (1983), no. 9, 441-444.
%H J. R. Trollope, <a href="http://www.jstor.org/stable/2687954">An explicit expression for binary digital sums</a>, Math. Mag. 41 1968 21-25.
%t Accumulate[f[n_]:=n - 4 Sum[Floor[n/5^k], {k, n}]; Array[f, 100, 0]^3] (* _Vincenzo Librandi_, Sep 04 2016 *)
%Y Cf. A053824, A231668, A231669, A231671.
%K nonn,base
%O 0,3
%A _N. J. A. Sloane_, Nov 13 2013