|
|
A231676
|
|
a(n) = Sum_{i=0..n} digsum_7(i), where digsum_7(i) = A053828(i).
|
|
5
|
|
|
0, 1, 3, 6, 10, 15, 21, 22, 24, 27, 31, 36, 42, 49, 51, 54, 58, 63, 69, 76, 84, 87, 91, 96, 102, 109, 117, 126, 130, 135, 141, 148, 156, 165, 175, 180, 186, 193, 201, 210, 220, 231, 237, 244, 252, 261, 271, 282, 294, 295, 297, 300, 304, 309, 315, 322, 324, 327, 331, 336, 342, 349, 357, 360, 364, 369, 375, 382, 390, 399, 403, 408, 414, 421, 429, 438, 448, 453, 459, 466
(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
|
Accumulate[Table[Total[IntegerDigits[n, 7]], {n, 0, 80}]] (* Harvey P. Dale, Aug 28 2021 *)
|
|
PROG
|
(PARI) a(n) = sum(i=0, n, sumdigits(i, 7)); \\ Michel Marcus, Dec 09 2021
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,base
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|