OFFSET
0,3
LINKS
Amiram Eldar, Table of n, a(n) for n = 0..10001
Jean Coquet, Power sums of digital sums, J. Number Theory, Vol. 22, No. 2 (1986), pp. 161-176.
P. J. Grabner, P. Kirschenhofer, H. Prodinger and R. F. Tichy, On the moments of the sum-of-digits function, PDF, Applications of Fibonacci numbers, Vol. 5 (St. Andrews, 1992), Kluwer Acad. Publ., Dordrecht, 1993, pp. 263-271.
Robert E. Kennedy and Curtis N. Cooper, An extension of a theorem by Cheo and Yien concerning digital sums, Fibonacci Quarterly, Vol. 29, No. 2 (1991), pp. 145-149.
J.-L. Mauclaire and Leo Murata, On q-additive functions. I, Proc. Japan Acad. Ser. A Math. Sci., Vol. 59, No. 6 (1983), pp. 274-276.
J.-L. Mauclaire and Leo Murata, On q-additive functions. II, Proc. Japan Acad. Ser. A Math. Sci., Vol. 59, No. 9 (1983), pp. 441-444.
Harald Riede, Asymptotic estimation of a sum of digits, Fibonacci Quarterly, Vol. 36, No. 1 (1998), pp. 72-75.
J. R. Trollope, An explicit expression for binary digital sums, Math. Mag., Vol. 41, No. 1 (1968), pp. 21-25.
MAPLE
See A037123.
MATHEMATICA
Accumulate[Table[Total[IntegerDigits[n]]^4, {n, 0, 60}]] (* Harvey P. Dale, May 12 2014 *)
PROG
(PARI) a(n) = sum(i=0, n, sumdigits(i)^4); \\ Michel Marcus, Sep 20 2017
CROSSREFS
KEYWORD
nonn,base
AUTHOR
N. J. A. Sloane, Nov 13 2013
STATUS
approved