The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 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. 0
 1362, 2017, 6654, 911, 319, 6702, 4954, 5496, 9213, 402, 1644, 1813, 2059, 2687, 4020, 679, 108, 540, 1396, 4668, 128, 6552, 2546, 1168, 386, 3349, 6363, 900, 4920, 980, 377, 4072, 5825, 700, 1967, 979, 10796, 4081, 4653, 2084, 11509, 3112, 11177 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS The trivial case for i=1 is omitted. LINKS Table of n, a(n) for n=1..43. PROG (PARI) /* The first occurrence of 10 digits of i-th root of x contains 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); ) ) } CROSSREFS Sequence in context: A260441 A265498 A113507 * A004930 A004950 A276170 Adjacent sequences: A119518 A119519 A119520 * A119522 A119523 A119524 KEYWORD base,easy,nonn AUTHOR Cino Hilliard, May 27 2006 STATUS approved

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

Last modified February 25 04:52 EST 2024. Contains 370310 sequences. (Running on oeis4.)