

A109691


Smallest 5th power that contains exactly n occurrences of the string n.


2



1, 1, 248832, 6436343, 45435424, 15575653771875, 616132666368, 778890712975487707, 6648881538818884375, 99900039992000799968, 10610441011074322410255643277715061010710106439101, 11311111984777108548801111731222111251108343
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

0,3


COMMENTS



LINKS



EXAMPLE

a(2)=248832 since this is the first 5th power that contains exactly two 2's.


PROG

(Python)
def count_overlaps(subs, s):
c = i = 0
while i != 1:
i = s.find(subs, i)
if i != 1: c += 1; i += 1
return c
strn = str(n)
k = int((10**(len(set(strn))*n1))**(1/POW)) # len(strn) for no overlaps
while True:
# if str(pow(k, POW)).count(strn) == n: break # use this for no overlaps
if count_overlaps(strn, str(pow(k, POW))) == n: break
k += 1
return k**POW


CROSSREFS



KEYWORD

base,more,nonn


AUTHOR



EXTENSIONS



STATUS

approved



