|
|
A231680
|
|
a(n) = Sum_{i=0..n} digsum_8(i), where digsum_8(i) = A053829(i).
|
|
5
|
|
|
0, 1, 3, 6, 10, 15, 21, 28, 29, 31, 34, 38, 43, 49, 56, 64, 66, 69, 73, 78, 84, 91, 99, 108, 111, 115, 120, 126, 133, 141, 150, 160, 164, 169, 175, 182, 190, 199, 209, 220, 225, 231, 238, 246, 255, 265, 276, 288, 294, 301, 309, 318, 328, 339, 351, 364, 371, 379, 388, 398, 409, 421, 434, 448, 449, 451, 454, 458, 463, 469, 476, 484, 486, 489, 493, 498, 504, 511, 519, 528
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,3
|
|
REFERENCES
|
Jean-Paul Allouche and Jeffrey Shallit, Automatic sequences, Cambridge University Press, 2003, p. 94.
|
|
LINKS
|
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), pp. 263-271, Kluwer Acad. Publ., Dordrecht, 1993.
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.
|
|
FORMULA
|
|
|
MATHEMATICA
|
a[n_] := Plus @@ IntegerDigits[n, 8]; Accumulate @ Array[a, 80, 0] (* Amiram Eldar, Dec 09 2021 *)
|
|
PROG
|
(PARI) a(n) = sum(i=0, n, sumdigits(i, 8)); \\ Michel Marcus, Sep 20 2017
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,base
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|