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 #12 Jan 18 2019 09:12:31
%S 0,1,17,98,99,115,196,452,468,549,805,1430,1511,1767,2392,3688,3689,
%T 3705,3786,4042,4058,4139,4395,5020,5101,5357,5982,7278,7534,8159,
%U 9455,11856,11872,11953,12209,12834,12915,13171,13796,15092,15348,15973,17269,19670,20295,21591,23992,28088,28169,28425,29050,30346,30602,31227,32523,34924,35549,36845,39246,43342
%N a(n) = Sum_{i=0..n} digsum_4(i)^4, where digsum_4(i) = A053737(i).
%H Marius A. Burtea, <a href="/A231667/b231667.txt">Table of n, a(n) for n = 0..10000</a>
%H Jean Coquet, <a href="https://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 P. J. Grabner, P. Kirschenhofer, H. Prodinger, R. F. Tichy, <a href="http://math.sun.ac.za/~hproding/abstract/abs_80.htm">On the moments of the sum-of-digits function</a>, <a href="http://math.sun.ac.za/~hproding/pdffiles/st_andrews.pdf">PDF</a>, Applications of Fibonacci numbers, Vol. 5 (St. Andrews, 1992), 263-271, Kluwer Acad. Publ., Dordrecht, 1993.
%H J.-L. Mauclaire, Leo Murata, <a href="https://dx.doi.org/10.3792/pjaa.59.274">On q-additive functions. I</a>, Proc. Japan Acad. Ser. A Math. Sci. 59 (1983), no. 6, 274-276.
%H J.-L. Mauclaire, Leo Murata, <a href="https://dx.doi.org/10.3792/pjaa.59.441">On q-additive functions. II</a>, 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.
%o (PARI) a(n) = sum(i=0, n, sumdigits(i, 4)^4); \\ _Michel Marcus_, Sep 20 2017
%Y Cf. A053737, A231664, A231665, A231666.
%K nonn,base
%O 0,3
%A _N. J. A. Sloane_, Nov 13 2013