The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A247794 a(n)^3 is the least cube to contain exactly n distinct digits. 1
 0, 3, 5, 12, 22, 59, 135, 289, 1018, 2326 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS "...at least n..." and "...exactly n..." yield the same sequence (i.e. this sequence is strictly increasing). LINKS MATHEMATICA With[{cbs=Table[{n, Count[DigitCount[n^3], _?(#>0&)]}, {n, 2500}]}, Join[{0}, Transpose[Table[SelectFirst[cbs, #[[2]]==i&], {i, 2, 10}]][[1]]]] (* The program uses the SelectFirst function from Mathematica version 10 *) (* Harvey P. Dale, Aug 20 2015 *) PROG (PARI) a(n)= k=0; while(#vecsort(digits(k^3), , 8)!=n, k++); k vector(10, n, a(n)) CROSSREFS Cf. A054039. Sequence in context: A121482 A013498 A161624 * A034758 A215109 A131322 Adjacent sequences:  A247791 A247792 A247793 * A247795 A247796 A247797 KEYWORD nonn,fini,full,base,easy AUTHOR Derek Orr, Sep 23 2014 STATUS approved

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

Last modified September 21 11:46 EDT 2020. Contains 337268 sequences. (Running on oeis4.)