login

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 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A245726
The digit occurring n times in A225842.
1
0, 1, 5, 7, 7, 2, 4, 7, 9, 7, 0, 3, 6, 6, 1, 2, 4, 4, 8, 8, 0, 8, 8, 0, 9, 1, 8, 8, 6, 8, 0, 8, 5, 6, 9, 5, 9, 7, 9, 9, 0, 1, 0, 3, 1, 3, 8, 3, 7, 6, 0, 5, 0, 6, 6, 1, 7, 7, 4, 5, 0, 8, 6, 4, 9, 1, 0, 1, 2, 0, 0, 1, 4, 6, 4, 2, 6, 5, 1, 7, 0, 9, 2, 7, 3, 1, 8, 1, 7, 7, 0, 4, 1, 1, 0, 9, 1
OFFSET
0,3
COMMENTS
The digit occurring n times in a smaller power of n than any other digit. In case of a tie the smallest digit is chosen. For example, a(2) = 5 for 2^16 = 65536. - Jens Kruse Andersen, Aug 01 2014
LINKS
PROG
(Python)
def a(n):
..b = '0123456789'
..for k in range(10**4):
....s = str(n**k)
....for i in b:
......if s.count(i) >= n:
........return int(i)
n = 0
while n < 150:
..print(a(n), end=', ')
..n += 1
CROSSREFS
Cf. A225842.
Sequence in context: A001620 A242220 A357068 * A101456 A084823 A117034
KEYWORD
nonn,base
AUTHOR
Derek Orr, Jul 30 2014
STATUS
approved