|
%I #9 Oct 01 2013 17:58:25
%S 1362,2017,6654,911,319,6702,4954,5496,9213,402,1644,1813,2059,2687,
%T 4020,679,108,540,1396,4668,128,6552,2546,1168,386,3349,6363,900,4920,
%U 980,377,4072,5825,700,1967,979,10796,4081,4653,2084,11509,3112,11177
%N 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 The trivial case for i=1 is omitted.
%o (PARI) /* The first occurrence of 10 digits of i-th root of x contains all digits 0-9. */
%o 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); ) ) }
%K base,easy,nonn
%O 1,1
%A _Cino Hilliard_, May 27 2006
|
