%I A119521
%S A119521 1362,2017,6654,911,319,6702,4954,5496,9213,402,1644,1813,2059,2687,
%T A119521 4020,679,108,540,1396,4668,128,6552,2546,1168,386,3349,6363,900,4920,
%U A119521 980,377,4072,5825,700,1967,979,10796,4081,4653,2084,11509,3112,11177
%N A119521 Numbers n such that first occurrence of the 10 digits of the i-th root 
               of n contain all the digits from 0 to 9.
%C A119521 The trivial case for i=1 is omitted.
%o A119521 (PARI) \The first occurrence of 10 digits of i-th root of x ontains all 
               digits 0-9. rootdigits2(n,m) = { local(f,x,y,a,d,s); for(i=2,m, 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",");break); ) ) }
%Y A119521 Sequence in context: A125270 A023091 A113507 this_sequence A004930 A004950 
               A028486
%Y A119521 Adjacent sequences: A119518 A119519 A119520 this_sequence A119522 A119523 
               A119524
%K A119521 base,easy,nonn
%O A119521 1,1
%A A119521 Cino Hilliard (hillcino368(AT)gmail.com), May 27 2006