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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A119519 The first 10 digits of the fourth root of n contain the digits 0-9. 0
6654, 14311, 14422, 14505, 24364, 25646, 33421, 35833, 36759, 36870, 37112, 37628, 41108, 42606, 45886, 46453, 46729, 47183, 49698, 50064, 56023, 66932, 69520, 70236, 70367, 71443, 71898, 73005, 73676, 74488, 74972, 75464, 78872, 82066 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
EXAMPLE
n=6654. n(1/4) = 9.031724865..., so 6654 is the first entry.
MATHEMATICA
okQ[n_]:=With[{ptrn=Table[1, {10}]}, Module[{rd10=RealDigits[Power[n, (4)^-1], 10, 10][[1]]}, DigitCount[FromDigits[rd10]]==ptrn]]; Select[Range[90000], okQ] (* Harvey P. Dale, Jan 21 2011 *)
PROG
(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", ")); ) }
CROSSREFS
Cf. A113507.
Sequence in context: A048268 A043634 A060792 * A233661 A131645 A186086
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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 1 20:04 EDT 2024. Contains 372176 sequences. (Running on oeis4.)