The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A231501 a(n) = Sum_{i=0..n} wt(i)^3, where wt() = A000120(). 2
 0, 1, 2, 10, 11, 19, 27, 54, 55, 63, 71, 98, 106, 133, 160, 224, 225, 233, 241, 268, 276, 303, 330, 394, 402, 429, 456, 520, 547, 611, 675, 800, 801, 809, 817, 844, 852, 879, 906, 970, 978, 1005, 1032, 1096, 1123, 1187, 1251, 1376, 1384, 1411, 1438, 1502, 1529, 1593, 1657, 1782, 1809, 1873, 1937, 2062, 2126, 2251 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 LINKS 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, hammingweight(i)^3); \\ Michel Marcus, Sep 20 2017 CROSSREFS Cf. A000120, A000788, A231500, A231502. Sequence in context: A282093 A032930 A033293 * A051373 A131096 A069263 Adjacent sequences:  A231498 A231499 A231500 * A231502 A231503 A231504 KEYWORD nonn,base AUTHOR N. J. A. Sloane, Nov 12 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 April 20 18:08 EDT 2021. Contains 343135 sequences. (Running on oeis4.)