This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A231667 a(n) = Sum_{i=0..n} digsum_4(i)^4, where digsum_4(i) = A053737(i). 5
 0, 1, 17, 98, 99, 115, 196, 452, 468, 549, 805, 1430, 1511, 1767, 2392, 3688, 3689, 3705, 3786, 4042, 4058, 4139, 4395, 5020, 5101, 5357, 5982, 7278, 7534, 8159, 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 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 LINKS Marius A. Burtea, Table of n, a(n) for n = 0..10000 Jean Coquet, Power sums of digital sums, J. Number Theory 22 (1986), no. 2, 161-176. P. J. Grabner, P. Kirschenhofer, H. Prodinger, R. F. Tichy, On the moments of the sum-of-digits function, PDF, Applications of Fibonacci numbers, Vol. 5 (St. Andrews, 1992), 263-271, Kluwer Acad. Publ., Dordrecht, 1993. J.-L. Mauclaire, Leo Murata, On q-additive functions. I, Proc. Japan Acad. Ser. A Math. Sci. 59 (1983), no. 6, 274-276. J.-L. Mauclaire, Leo Murata, On q-additive functions. II, Proc. Japan Acad. Ser. A Math. Sci. 59 (1983), no. 9, 441-444. J. R. Trollope, An explicit expression for binary digital sums, Math. Mag. 41 1968 21-25. PROG (PARI) a(n) = sum(i=0, n, sumdigits(i, 4)^4); \\ Michel Marcus, Sep 20 2017 CROSSREFS Cf. A053737, A231664, A231665, A231666. Sequence in context: A184327 A262207 A282997 * A044268 A044649 A253707 Adjacent sequences:  A231664 A231665 A231666 * A231668 A231669 A231670 KEYWORD nonn,base AUTHOR N. J. A. Sloane, Nov 13 2013 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified August 21 18:26 EDT 2019. Contains 326168 sequences. (Running on oeis4.)