login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A131542 Least power of 2 having exactly n consecutive 8's in its decimal representation. 2

%I #9 Jun 18 2015 14:17:53

%S 3,19,39,180,316,971,6836,25263,103825,279274,279268,1727604,18053496,

%T 8760852

%N Least power of 2 having exactly n consecutive 8's in its decimal representation.

%C No more terms < 28*10^6.

%H Popular Computing (Calabasas, CA), <a href="/A094776/a094776.jpg">Two Tables</a>, Vol. 1, (No. 9, Dec 1973), page PC9-16.

%e a(3)=39 because 2^39(i.e. 549755813888) is the smallest power of 2 to contain a run of 3 consecutive eights in its decimal form.

%t a = ""; Do[ a = StringJoin[a, "8"]; b = StringJoin[a, "8"]; k = 1; While[ StringPosition[ ToString[2^k], a] == {} || StringPosition[ ToString[2^k], b] != {}, k++ ]; Print[k], {n, 1, 10} ]

%K more,nonn,base

%O 1,1

%A _Shyam Sunder Gupta_, Aug 26 2007

%E Two more terms from _Sean A. Irvine_, May 31 2010

%E a(13)-a(14) from _Lars Blomberg_, Jan 24 2013

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 01:06 EDT 2024. Contains 371964 sequences. (Running on oeis4.)