This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A004164 #21 Jul 19 2024 10:10:59 %S A004164 0,1,8,9,10,8,9,10,8,18,1,8,18,19,17,18,19,17,18,28,8,18,19,17,18,19, %T A004164 26,27,19,26,9,28,26,27,19,26,27,19,26,27,10,26,27,28,26,18,28,17,18, %U A004164 28,8,18,19,35,27,28,26,27,19,26,9,28,26,18,19,26,36,19 %N A004164 Sum of digits of n^3. %C A004164 For the digital root of n^3 see A073636. %C A004164 The greedy inverse is 1, -1, -1, -1, -1, -1, -1, 2, 3, 4, -1, -1, -1, -1, -1, -1, 14, 9, 13, -1, -1, .. where -1 means the inverse does not exist. Essentially provided by A067177. - _R. J. Mathar_, Jul 19 2024 %H A004164 Nathaniel Johnston, <a href="/A004164/b004164.txt">Table of n, a(n) for n = 0..10000</a> %H A004164 Michael Drmota, Christian Mauduit, Joël Rivat, <a href="http://www.dmg.tuwien.ac.at/drmota/dmr6.pdf">The sum-of-digits function of polynomial sequences</a>, J. Lond. Math. Soc. (2) 84(2011), no. 1, 81--102. MR2819691 (2012f:11193). %p A004164 A004164 := proc(n) return add(d, d=convert(n^3,base,10)): end: seq(A004164(n),n=0..100); # _Nathaniel Johnston_, May 05 2011 %t A004164 DigitSum[Range[0, 100]^3] (* _Paolo Xausa_, Jul 03 2024 *) %o A004164 (PARI) a(n) = sumdigits(n^3); \\ _Michel Marcus_, Jul 07 2019 %Y A004164 Cf. A004159, A007953. %K A004164 nonn,easy,base %O A004164 0,3 %A A004164 _N. J. A. Sloane_