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

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A285450 Least number x such that x^n has n digits equal to k. Case k = 3. 2
3, 56, 179, 34, 202, 536, 607, 1182, 1236, 3875, 3076, 2142, 4574, 5378, 9347, 14524, 2013, 8403, 13037, 9534, 20939, 1987, 28882, 27146, 16292, 34546, 48493, 85926, 52953, 48318, 64558, 116514, 49665, 90279, 46911, 117256, 61286, 139083, 120265, 199582, 170357 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
EXAMPLE
a(4) = 34 because 34^4 = 1336336 has 4 digits '3' 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, 3);
PROG
(PARI) a(n, k=3) = {my(j=1); while(#select(x->x==k, digits(j^n)) != n, j++); j; } \\ Michel Marcus, Apr 29 2017
(PARI) A285450vec=(n, {k=3})->{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))} \\ Returns a vector containing the first n terms. - R. J. Cano, Apr 29 2017
CROSSREFS
Sequence in context: A290773 A119188 A111451 * A280805 A198184 A262398
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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 2 15:57 EST 2023. Contains 367524 sequences. (Running on oeis4.)