%I #21 Jul 19 2024 10:10:59
%S 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 26,27,19,26,9,28,26,27,19,26,27,19,26,27,10,26,27,28,26,18,28,17,18,
%U 28,8,18,19,35,27,28,26,27,19,26,9,28,26,18,19,26,36,19
%N Sum of digits of n^3.
%C For the digital root of n^3 see A073636.
%C 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 Nathaniel Johnston, <a href="/A004164/b004164.txt">Table of n, a(n) for n = 0..10000</a>
%H 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 := proc(n) return add(d, d=convert(n^3,base,10)): end: seq(A004164(n),n=0..100); # _Nathaniel Johnston_, May 05 2011
%t DigitSum[Range[0, 100]^3] (* _Paolo Xausa_, Jul 03 2024 *)
%o (PARI) a(n) = sumdigits(n^3); \\ _Michel Marcus_, Jul 07 2019
%Y Cf. A004159, A007953.
%K nonn,easy,base
%O 0,3
%A _N. J. A. Sloane_