A244604 Least number k such that k^n contains the digit n n times.

1, 1, 15, 179, 261, 435, 426, 1083, 2169, 2137

Offset

0,3

Links

Table of n, a(n) for n=0..9.

Example

1 is the smallest number such that 1^0 contains 0 zero times. So a(0) = 1.
15 is the smallest number such that 15^2 contains 2 twice. So a(2) = 15.
261 is the smallest number such that 261^4 contains 4 four times. So a(4) = 261.

Prog

(Python)
def tes(n):
  for k in range(1, 10**4):
    if(str(k**n).count(str(n))) == n:
      return k
n = 0
while n < 10:
  print(tes(n), end=', ')
  n += 1

Crossrefs

Cf. A244603.

Sequence in context: A009146 A012800 A016216 * A001717 A293476 A004992

Adjacent sequences: A244601 A244602 A244603 * A244605 A244606 A244607

Keyword

nonn,base,fini,full

Author

Derek Orr, Jul 01 2014

Status

approved