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

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A135050 Numbers k such that sum of digits of k^3 is 8. Multiples of 10 are omitted. 0
 2, 5, 8, 11, 101, 1001, 10001, 100001, 1000001, 10000001, 100000001, 1000000001, 10000000001, 100000000001, 1000000000001, 10000000000001, 100000000000001, 1000000000000001, 10000000000000001, 100000000000000001, 1000000000000000001, 10000000000000000001 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS All numbers of form 10..01 are eligible. Are there larger terms of other forms? All terms up to 10^20 are of this form, except for 2, 5 and 8. - Max Alekseyev, Feb 11 2008 Numbers k such that k > 1 and sum of digits of k^3 is less than 9. Multiples of 10 are omitted. - Farideh Firoozbakht, Oct 18 2013 LINKS EXAMPLE 2^3=8, 5^3=125, 8^3=512, 11^3=1331, 101^3=1030301, 1001^3=1003003001, 10001^3=1000300030001. MATHEMATICA Do[If[Total[IntegerDigits[m^3]]==8&&Mod[m, 10]>0, Print[m]], {m, 100000}] PROG (PARI) isok(k) = (k % 10) && (sumdigits(k^3) == 8); \\ Michel Marcus, Feb 19 2021 CROSSREFS Sequence in context: A246442 A056661 A229883 * A004112 A024815 A073837 Adjacent sequences: A135047 A135048 A135049 * A135051 A135052 A135053 KEYWORD nonn,base AUTHOR Zak Seidov, Feb 11 2008 EXTENSIONS a(9) onwards from Max Alekseyev, Feb 11 2008 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.

Last modified December 4 02:16 EST 2022. Contains 358544 sequences. (Running on oeis4.)