Smallest positive integer k such that k^n contains each digit of k exactly n times, or -1 if no such k exists.
A391002
Smallest positive integer k such that k^n contains each digit of k exactly n times, or -1 if no such k exists.
Terms
- a(0) =1a(1) =72576a(2) =87624375a(3) =5702631489a(4) =961527834a(5) =7025869314a(6) =92751390846a(7) =847351722906a(8) =95479203618
External references
- oeis: A391002