|
|
A131543
|
|
Least power of 2 having exactly n consecutive 9's in its decimal representation.
|
|
3
|
|
|
12, 33, 50, 421, 422, 2187, 15554, 42483, 42485, 42486, 1522085, 2662514, 6855863, 6855865
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
No more terms < 28*10^6.
|
|
LINKS
|
Popular Computing (Calabasas, CA), Two Tables, Vol. 1, (No. 9, Dec 1973), page PC9-16.
|
|
EXAMPLE
|
a(3)=50 because 2^50(i.e. 1125899906842624) is the smallest power of 2 to contain a run of 3 consecutive nines in its decimal form.
|
|
MATHEMATICA
|
a = ""; Do[ a = StringJoin[a, "9"]; b = StringJoin[a, "9"]; k = 1; While[ StringPosition[ ToString[2^k], a] == {} || StringPosition[ ToString[2^k], b] != {}, k++ ]; Print[k], {n, 1, 10} ]
|
|
CROSSREFS
|
|
|
KEYWORD
|
more,nonn,base
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|