login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A165370 Smallest number whose sum of cubes of digits is n. 3
0, 1, 11, 111, 1111, 11111, 111111, 1111111, 2, 12, 112, 1112, 11112, 111112, 1111112, 11111112, 22, 122, 1122, 11122, 111122, 1111122, 11111122, 111111122, 222, 1222, 11222, 3, 13, 113, 1113, 11113, 2222, 12222, 112222, 23, 123, 1123, 11123 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
COMMENTS
A055012(a(n)) = n and A055012(m) <> n for m < a(n);
for all terms the digits are in nondecreasing order.
LINKS
Jon E. Schoenfield, Table of n, a(n) for n = 0..10000 (first 1001 terms from Reinhard Zumkeller)
PROG
(PARI) a(n) = my(k=1); while(vecsum(apply(x->(x^3), digits(k))) != n, k++); k; \\ Michel Marcus, Sep 08 2019
CROSSREFS
Sequence in context: A061851 A247552 A138145 * A134962 A267257 A113589
KEYWORD
nonn,look,base
AUTHOR
Reinhard Zumkeller, Sep 17 2009
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 19 07:31 EDT 2024. Contains 370955 sequences. (Running on oeis4.)