OFFSET
0,3
COMMENTS
For the digital root of n^3 see A073636.
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
LINKS
Nathaniel Johnston, Table of n, a(n) for n = 0..10000
Michael Drmota, Christian Mauduit, Joël Rivat, The sum-of-digits function of polynomial sequences, J. Lond. Math. Soc. (2) 84(2011), no. 1, 81--102. MR2819691 (2012f:11193).
MAPLE
A004164 := proc(n) return add(d, d=convert(n^3, base, 10)): end: seq(A004164(n), n=0..100); # Nathaniel Johnston, May 05 2011
MATHEMATICA
DigitSum[Range[0, 100]^3] (* Paolo Xausa, Jul 03 2024 *)
PROG
(PARI) a(n) = sumdigits(n^3); \\ Michel Marcus, Jul 07 2019
CROSSREFS
KEYWORD
nonn,easy,base
AUTHOR
STATUS
approved