The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A285452 Least number x such that x^n has n digits equal to k. Case k=5. 3
 5, 75, 136, 273, 435, 725, 715, 1696, 1205, 2965, 3705, 1692, 1953, 4508, 5915, 10948, 10124, 13734, 14696, 20727, 17653, 22122, 35855, 24016, 27643, 33171, 34153, 64855, 62667, 81285, 97193, 45112, 98735, 88505, 123345, 98556, 80633, 157034, 102908, 28383, 176175 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 LINKS Martin Gossow, Table of n, a(n) for n = 1..100 EXAMPLE a(4) = 273 because 273^4 = 5554571841 has 4 digits '5' and is the least number to have this property. MAPLE P:=proc(q, h) local a, j, k, n, t; for n from 1 to q do for k from 1 to q do a:=convert(k^n, base, 10); t:=0; for j from 1 to nops(a) do if a[j]=h then t:=t+1; fi; od; if t=n then print(k); break; fi; od; od; end: P(10^9, 5); MATHEMATICA With[{k = 5}, Table[x = 1; While[DigitCount[x^n, 10, k] != n, x++]; x, {n, 41}]] (* Michael De Vlieger, May 01 2017 *) PROG (PARI) A285452vec=(n, {k=5})->{my(L:list, c); L=List(); for(t=1, n, forstep(y=1, +oo, 1, c=digits(y^t); if(sum(j=1, #c, c[j]==k)==t, listput(L, y); break()))); return(Vec(L))} \\ R. J. Cano, Apr 30 2017 CROSSREFS Sequence in context: A080473 A266570 A156703 * A048350 A030991 A216093 Adjacent sequences:  A285449 A285450 A285451 * A285453 A285454 A285455 KEYWORD nonn,base,easy AUTHOR Paolo P. Lava, Apr 19 2017 STATUS approved

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

Last modified May 18 21:30 EDT 2021. Contains 344003 sequences. (Running on oeis4.)