|
| |
|
|
A131543
|
|
Least power of 2 having exactly n consecutive 9's in its decimal representation.
|
|
1
| |
|
|
12, 33, 50, 421, 422, 2187, 15554, 42483, 42485, 42486, 1522085
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,1
|
|
|
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
| Sequence in context: A192213 A050690 A079561 * A063296 A051624 A039338
Adjacent sequences: A131540 A131541 A131542 * A131544 A131545 A131546
|
|
|
KEYWORD
| more,nonn,base
|
|
|
AUTHOR
| Shyam Sunder Gupta (guptass(AT)rediffmail.com), Aug 26 2007
|
|
|
EXTENSIONS
| a(11) from Sean A. Irvine (sairvin(AT)xtra.co.nz), May 31 2010
|
| |
|
|
