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 A231673 #9 Sep 04 2016 18:49:42
%S A231673 0,1,5,14,30,55,56,60,69,85,110,146,150,159,175,200,236,285,294,310,
%T A231673 335,371,420,484,500,525,561,610,674,755,780,816,865,929,1010,1110,
%U A231673 1111,1115,1124,1140,1165,1201,1205,1214,1230,1255,1291,1340,1349,1365,1390,1426,1475,1539,1555,1580,1616,1665,1729,1810,1835,1871,1920,1984,2065,2165,2201,2250,2314,2395
%N A231673 a(n) = Sum_{i=0..n} digsum_6(i)^2, where digsum_6(i) = A053827(i).
%D A231673 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 A231673 Vincenzo Librandi, <a href="/A231673/b231673.txt">Table of n, a(n) for n = 0..1000</a>
%H A231673 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 A231673 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 A231673 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 A231673 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 A231673 Accumulate[f[n_]:=n - 5 Sum[Floor[n/6^k], {k, n}]; Array[f, 100, 0]^2] (* _Vincenzo Librandi_, Sep 04 2016 *)
%Y A231673 Cf. A053827, A231672, A231674, A231675.
%K A231673 nonn,base
%O A231673 0,3
%A A231673 _N. J. A. Sloane_, Nov 13 2013