This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A231674 #9 Sep 04 2016 16:45:44
%S A231674 0,1,9,36,100,225,226,234,261,325,450,666,674,701,765,890,1106,1449,
%T A231674 1476,1540,1665,1881,2224,2736,2800,2925,3141,3484,3996,4725,4850,
%U A231674 5066,5409,5921,6650,7650,7651,7659,7686,7750,7875,8091,8099,8126,8190,8315,8531,8874,8901,8965,9090,9306,9649,10161,10225,10350,10566,10909,11421,12150,12275,12491,12834,13346
%N A231674 a(n) = Sum_{i=0..n} digsum_6(i)^3, where digsum_6(i) = A053827(i).
%D A231674 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 A231674 Vincenzo Librandi, <a href="/A231674/b231674.txt">Table of n, a(n) for n = 0..1000</a>
%H A231674 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 A231674 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 A231674 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 A231674 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 A231674 Accumulate[f[n_]:=n - 5Sum[Floor[n/6^k], {k, n}]; Array[f, 100, 0]^3] (* _Vincenzo Librandi_, Sep 04 2016 *)
%Y A231674 Cf. A053827, A231672, A231673, A231675.
%K A231674 nonn,base
%O A231674 0,3
%A A231674 _N. J. A. Sloane_, Nov 13 2013