A231683 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

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”).

Other ways to Give

A231683

a(n) = Sum_{i=0..n} digsum_8(i)^4, where digsum_8(i) = A053829(i).

0, 1, 17, 98, 354, 979, 2275, 4676, 4677, 4693, 4774, 5030, 5655, 6951, 9352, 13448, 13464, 13545, 13801, 14426, 15722, 18123, 22219, 28780, 28861, 29117, 29742, 31038, 33439, 37535, 44096, 54096, 54352, 54977, 56273, 58674, 62770, 69331, 79331, 93972, 94597, 95893, 98294, 102390, 108951, 118951, 133592, 154328, 155624, 158025, 162121, 168682, 178682, 193323, 214059

(list; graph; refs; listen; history; text; internal format)

OFFSET

0,3

LINKS

Table of n, a(n) for n=0..54.

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, 8)^4); \\ Michel Marcus, Sep 20 2017

CROSSREFS

Cf. A053829, A231680, A231681, A231682.

Sequence in context: A231671 A231675 A231679 * A231687 A231689 A000538

Adjacent sequences: A231680 A231681 A231682 * A231684 A231685 A231686

KEYWORD

nonn,base

AUTHOR

N. J. A. Sloane, Nov 13 2013

STATUS

approved