Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A119519
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A119519 The first 10 digits of the fourth root of n contain the digits 0-9. +0
1
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; listen)
OFFSET

1,1

EXAMPLE

n=6654. n(1/4) = 9.031724865..., so 6654 is the first entry.

PROGRAM

(PARI) \The 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 this_sequence A131645 A015310 A043516

Adjacent sequences: A119516 A119517 A119518 this_sequence A119520 A119521 A119522

KEYWORD

base,easy,nonn

AUTHOR

Cino Hilliard (hillcino368(AT)gmail.com), May 27 2006

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 16 17:18 EST 2009. Contains 170825 sequences.


AT&T Labs Research