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 A119517 #13 Oct 01 2013 17:58:25
%S A119517 2017,3053,9950,15139,15533,18357,24214,24424,31457,32654,39605,46705,
%T A119517 47776,57692,60448,65839,65854,66999,67405,68512,70239,73985,74283,
%U A119517 74493,77913,79600,82431,83311,84467,91571,95557
%N A119517 The first 10 digits of the cube root of n contain the digits 0-9.
%C A119517 i = 2 produces A113507 in the PARI script.
%e A119517 n=9950. n^(1/3) = 21.50837964..., so 9950 is the third entry.
%t A119517 Select[Range[100000],Sort[RealDigits[Surd[#,3],10,10][[1]]]==Range[0,9]&] (* _Harvey P. Dale_, Jan 22 2013 *)
%o A119517 (PARI) \\ The first 10 digits of i-th root of x contain all of the digits 0-9. rootdigits(n,i) = { local(f,x,y,a,d,s); for(x=2,n, f=[0,0,0,0,0,0,0,0,0,0]; s=0; y=(x^(1/i))*10^9; a=Vec(Str(y)); for(d=1,10, k=eval(a[d]); if(k==0,k=10); f[k]=1; ); for(j=1,10,s+=f[j]); if(s==10,print1(x",")); ) }
%Y A119517 Cf. A113507.
%K A119517 base,easy,nonn
%O A119517 1,1
%A A119517 _Cino Hilliard_, May 27 2006