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 A320601 #8 Oct 17 2018 06:26:38
%S A320601 10,11,12,17,20,21,22,23,26,29,30,38,40,41,42,43,44,45,46,47,48,50,52,
%T A320601 53,54,55,56,57,58,59,60,61,62,63,64,65,66,68,69,70,71,73,74,75,78,79,
%U A320601 80,82,83,84,85,87,88,89,90,91,92,93,94,95,96,97,98,99,100,101,102,103,104,105
%N A320601 Exponents of powers of two having a digit zero in decimal.
%C A320601 Complement of A007377. It is a long-standing open problem to show that this sequence contains all numbers > 86.
%F A320601 { n | A027870(n) > 0}, where A027870 = A055641 o A000079.
%e A320601 The first term is a(1) = 10 since 2^10 = 1024 is the smallest power of 2 having a digit 0.
%o A320601 (PARI) for(n=1,199,vecmin(digits(2^n))||print1(n","))
%Y A320601 Cf. A000079, A007377, A027870, A055641.
%K A320601 nonn,base
%O A320601 1,1
%A A320601 _M. F. Hasler_, Oct 16 2018