This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A247794 #7 Aug 20 2015 10:43:13
%S A247794 0,3,5,12,22,59,135,289,1018,2326
%N A247794 a(n)^3 is the least cube to contain exactly n distinct digits.
%C A247794 "...at least n..." and "...exactly n..." yield the same sequence (i.e. this sequence is strictly increasing).
%t A247794 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 *)
%o A247794 (PARI)
%o A247794 a(n)= k=0;while(#vecsort(digits(k^3),,8)!=n,k++);k
%o A247794 vector(10,n,a(n))
%Y A247794 Cf. A054039.
%K A247794 nonn,fini,full,base,easy
%O A247794 1,2
%A A247794 _Derek Orr_, Sep 23 2014