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 A035057 #26 Jul 10 2025 11:04:10 %S A035057 1,2,3,5,6,8,11,12,15,16,19,23,25,28,32,33,35,38,43,52,56,59,63,66,73, %T A035057 91 %N A035057 Numbers k such that 2^k does not contain the digit 1 (probably finite). %C A035057 No other terms < 10^6. - _Chai Wah Wu_, Aug 31 2017 %t A035057 Select[Range[100],DigitCount[2^#,10,1]==0&] (* _Harvey P. Dale_, Jun 06 2013 *) %o A035057 (Magma) [n: n in [0..1000] | not 1 in Intseq(2^n) ]; // _Vincenzo Librandi_, May 06 2015 %o A035057 (Python) %o A035057 A035057_list = [n for n in range(1,10**3) if '1' not in str(2**n)] # _Chai Wah Wu_, Aug 31 2017 %o A035057 (PARI) A035057=[n|n<-[0..99], !setsearch(Set(digits(2^n)),1)] \\ _M. F. Hasler_, Jul 09 2025 %Y A035057 Cf. similar sequences listed in A035064. %K A035057 nonn,base %O A035057 1,2 %A A035057 _Patrick De Geest_, Nov 15 1998