cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A131543 Exponent of least power of 2 having exactly n consecutive 9's in its decimal representation.

This page as a plain text file.
%I A131543 #19 Jul 21 2024 12:48:20
%S A131543 0,12,33,50,421,422,2187,15554,42483,42485,42486,1522085,2662514,
%T A131543 6855863,6855865
%N A131543 Exponent of least power of 2 having exactly n consecutive 9's in its decimal representation.
%C A131543 Similarly to A006889, the least power of 2 to contain at least n consecutive 9's will always contain exactly n consecutive 9's. The previous power of two will contain exactly n-1 consecutive 9's preceded by a 4. - _Paul Geneau de Lamarlière_, Jul 20 2024
%C A131543 No more terms < 28*10^6.
%H A131543 Popular Computing (Calabasas, CA), <a href="/A094776/a094776.jpg">Two Tables</a>, Vol. 1, (No. 9, Dec 1973), page PC9-16.
%e A131543 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.
%t A131543 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} ]
%Y A131543 Cf. A006889.
%K A131543 more,nonn,base
%O A131543 0,2
%A A131543 _Shyam Sunder Gupta_, Aug 26 2007
%E A131543 a(11) from _Sean A. Irvine_, May 31 2010
%E A131543 a(12)-a(14) from _Lars Blomberg_, Jan 24 2013
%E A131543 a(0)=0 prepended by _Paul Geneau de Lamarlière_, Jul 20 2024