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 A238938 #24 Nov 08 2021 08:10:20 %S A238938 1,2,4,8,16,32,64,128,256,512,8192,16384,32768,65536,262144,524288, %T A238938 16777216,33554432,134217728,268435456,2147483648,4294967296, %U A238938 8589934592,17179869184,34359738368,68719476736,137438953472,549755813888,562949953421312,2251799813685248,147573952589676412928 %N A238938 Powers of 2 without the digit '0' in their decimal expansion. %C A238938 Conjectured to be finite and complete. See the OEIS wiki page for further information, references and links. %H A238938 Daniel Mondot, <a href="/A238938/b238938.txt">Table of n, a(n) for n = 1..36</a> %H A238938 M. F. Hasler, <a href="https://oeis.org/wiki/Zeroless_powers">Zeroless powers</a>, OEIS wiki, Mar 07 2014 %F A238938 a(n) = 2^A007377(n). %e A238938 256 = 2^8 is in the sequence because 256 has a 2, a 5 and a 6 but no 0's. %e A238938 512 = 2^9 is also in because it has a 1, a 2 and a 5 but no 0's. %e A238938 1024 = 2^10 is not in the sequence because it has a 0. %t A238938 Select[2^Range[0, 127], DigitCount[#, 10, 0] == 0 &] (* _Alonso del Arte_, Mar 07 2014 *) %o A238938 (PARI) for(n=0,99,vecmin(digits(2^n))&& print1(2^n",")) %Y A238938 Cf. A007377, A030700, A030701, A008839, A030702, A030703, A030704, A030705, A030706, A195944. %Y A238938 Cf. A195908, A195946, A195945. %Y A238938 Cf. A195942, A195943, A027870, A102483. %K A238938 nonn,base %O A238938 1,2 %A A238938 _M. F. Hasler_, Mar 07 2014 %E A238938 'fini' keyword removed as finiteness is only conjectured by _Max Alekseyev_, Apr 10 2019