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 A071071 #33 Aug 24 2019 14:36:46 %S A071071 1,2,4,8,65536 %N A071071 Minimal "powers of 2" set in base 10: any power of 2 contains at least one term of this sequence in its decimal expansion. %C A071071 Conjectured by J. Shallit to be complete. %C A071071 A possible exception are powers of 16. It can be proved that 16^(5^(k-1) + floor((k+3)/4)) == 16^floor((k+3)/4) (mod 10^k) (see attached proof). Thus it may be that there is a power of 16 that does not contain any of the digits 1, 2, 4, and 8 or the number 65536 as a substring. - _Bassam Abdul-Baki_, Apr 10 2019 %D A071071 J.-P. Delahaye, Nombres premiers inévitables et pyramidaux, Pour la science, (French edition of Scientific American), Juin 2002, p. 98 %H A071071 Bassam Abdul-Baki, <a href="/A071071/a071071.pdf">Minimal Sets for Powers of 2</a> %H A071071 David Butler, <a href="https://blogs.adelaide.edu.au/maths-learning/2017/06/21/65536/">65536</a>, Making Your Own Sense, June 21 2017. %H A071071 Jeffrey Shallit, <a href="http://recursed.blogspot.com/2006/12/prime-game.html">The Prime Game</a>, Recursivity, December 01 2006. %H A071071 <a href="/index/Di#divseq">Index to divisibility sequences</a> %Y A071071 Cf. A071062, A071070, A071072, A071073. %K A071071 fini,full,nonn,base %O A071071 1,2 %A A071071 _Benoit Cloitre_, May 26 2002