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.
%I A053377 #7 Jun 13 2020 15:12:41 %S A053377 8,88,888,3888,33888,333888,3333888,83333888,383333888,3383333888, %T A053377 33383333888,833383333888,8833383333888,88833383333888, %U A053377 888833383333888,8888833383333888,88888833383333888,888888833383333888 %N A053377 a(n) contains n digits (either '3' or '8') and is divisible by 2^n. %H A053377 Ray Chandler, <a href="/A053377/b053377.txt">Table of n, a(n) for n = 1..1000</a> %F A053377 a(n)=a(n-1)+10^(n-1)*(8-5*[a(n-1)/2^(n-1) mod 2]) i.e. a(n) ends with a(n-1); if (n-1)-th term is divisible by 2^n then n-th term begins with an 8, if not then n-th term begins with a 3. %t A053377 Flatten[Table[Select[FromDigits/@Tuples[{3,8},n],Divisible[#,2^n]&],{n,18}]] (* _Harvey P. Dale_, Dec 25 2015 *) %Y A053377 Cf. A023412, A050621, A050622, A035014. %K A053377 base,nonn %O A053377 1,1 %A A053377 _Henry Bottomley_, Mar 06 2000