|
|
A215731
|
|
a(n) is the smallest m for which the decimal representation of 11^m contains n consecutive identical digits.
|
|
13
|
|
|
0, 1, 8, 39, 156, 482, 1323, 2983, 9443, 39879, 214747, 296095, 296095, 5541239, 8621384
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,3
|
|
LINKS
|
|
|
EXAMPLE
|
The decimal representation of 11^39879 contains ten consecutive 6s, and is the least such power with such a string of digits.
|
|
MATHEMATICA
|
mostDigits[t_] := Module[{lastDigit = t[[1]], record = 1, cnt = 1}, Do[If[t[[n]] == lastDigit, cnt++, If[cnt > record, record = cnt]; cnt = 1; lastDigit = t[[n]]], {n, 2, Length[t]}]; If[cnt > record, record = cnt] ; record]; nn = 10; t = Table[-1, {nn}]; n = -1; While[Min[t] == -1, n++; c = mostDigits[IntegerDigits[11^n]]; If[c > nn, c = nn]; While[c > 0 && t[[c]] == -1, t[[c]] = n; c--]]; t (* T. D. Noe, Apr 29 2013 *)
|
|
PROG
|
(Python)
l, x = [str(d)*n for d in range(10)], 1
for m in range(10**9):
s = str(x)
for k in l:
if k in s:
return m
x *= 11
return 'search limit reached'
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,base,more
|
|
AUTHOR
|
|
|
EXTENSIONS
|
a(10) discovered by "Wick" (See http://www.mersenneforum.org/showpost.php?p=334789&postcount=89). Definition clarified and all terms to a(10) verified by Daran Gill, Mar 24 2013
a(11) discovered by Tom Womack (See http://www.mersenneforum.org/showpost.php?p=337916&postcount=105), Rick van der Hoorn, Apr 24 2013
|
|
STATUS
|
approved
|
|
|
|