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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A231674 a(n) = Sum_{i=0..n} digsum_6(i)^3, where digsum_6(i) = A053827(i). 5
0, 1, 9, 36, 100, 225, 226, 234, 261, 325, 450, 666, 674, 701, 765, 890, 1106, 1449, 1476, 1540, 1665, 1881, 2224, 2736, 2800, 2925, 3141, 3484, 3996, 4725, 4850, 5066, 5409, 5921, 6650, 7650, 7651, 7659, 7686, 7750, 7875, 8091, 8099, 8126, 8190, 8315, 8531, 8874, 8901, 8965, 9090, 9306, 9649, 10161, 10225, 10350, 10566, 10909, 11421, 12150, 12275, 12491, 12834, 13346 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
REFERENCES
Grabner, P. J.; Kirschenhofer, P.; Prodinger, H.; Tichy, R. F.; On the moments of the sum-of-digits function. Applications of Fibonacci numbers, Vol. 5 (St. Andrews, 1992), 263-271, Kluwer Acad. Publ., Dordrecht, 1993.
LINKS
J. Coquet, Power sums of digital sums, J. Number Theory 22 (1986), no. 2, 161-176.
J.-L. Mauclaire and Leo Murata, On q-additive functions, I. Proc. Japan Acad. Ser. A Math. Sci. 59 (1983), no. 6, 274-276.
J.-L. Mauclaire and 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.
MATHEMATICA
Accumulate[f[n_]:=n - 5Sum[Floor[n/6^k], {k, n}]; Array[f, 100, 0]^3] (* Vincenzo Librandi, Sep 04 2016 *)
CROSSREFS
Sequence in context: A134537 A066647 A187607 * A085037 A231678 A231682
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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 24 19:44 EDT 2024. Contains 373690 sequences. (Running on oeis4.)