|
|
A067075
|
|
a(n) is the smallest number m such that the sum of the digits of m^3 is equal to n^3.
|
|
9
|
|
|
|
OFFSET
|
0,3
|
|
COMMENTS
|
a(n) >= ceiling(A051885(n^3)^(1/3)). For example a(7) >= ceiling(A051885(7^3)^(1/3)) = ceiling((2*10^38-1)^(1/3)) = 5848035476426 - David A. Corneth, Aug 23 2018
|
|
LINKS
|
|
|
EXAMPLE
|
a(3) = 27 as 27^3 = 19683 is the smallest cube whose digit sum = 27 = 3^3.
|
|
MATHEMATICA
|
Do[k = 1; While[Plus @@ IntegerDigits[k^3] != n^3, k++ ]; Print[k], {n, 1, 6}] (* Ryan Propper, Jul 07 2005 *)
|
|
PROG
|
(PARI) a(n) = my(k=0); while (sumdigits(k^3) != n^3, k++); k; \\ Seiichi Manyama, Aug 12 2017
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,base,more
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|