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!)
 A244603 Least number k such that n^k contains the digit n n times. 2
 1, 18, 21, 32, 30, 38, 33, 55, 69 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS EXAMPLE 2^18 is the first power of 2 to contain 2 twice. So a(2) = 18. 3^21 is the first power of 3 to contain 3 three times. So a(3) = 21. PROG (Python) def tes(n): ..for k in range(1, 10**3): ....if(str(n**k).count(str(n)) == n: ......return k n = 1 while n < 10: ..print(tes(n), end=', ') ..n += 1 CROSSREFS Sequence in context: A001101 A088341 A105145 * A120416 A293751 A090891 Adjacent sequences:  A244600 A244601 A244602 * A244604 A244605 A244606 KEYWORD nonn,base,fini,full AUTHOR Derek Orr, Jul 01 2014 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 31 22:45 EDT 2020. Contains 334756 sequences. (Running on oeis4.)