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 A130694 #35 Oct 05 2021 14:02:48
%S A130694 68,70,79,82,84,87,88,89,94,95,96,97,98,100,101,103,104,105,106,109,
%T A130694 110,111,112,113,114,115,116,117,118,119,120,121,122,123,124,125,126,
%U A130694 127,128,129,130,131,132,133,134,135,136,137,138,139,140,141,142,143,144
%N A130694 Exponents of powers of 2 that contain all ten digits.
%C A130694 It is believed that every power of 2 beyond 2^86 contains the digit 0.
%C A130694 For k in {51,67,72,76,81,86}, 2^k contains all nonzero digits, but does not contain 0. - _Dimiter Skordev_, Oct 05 2021
%H A130694 Seiichi Manyama, <a href="/A130694/b130694.txt">Table of n, a(n) for n = 1..10000</a>
%F A130694 A043537(A000079(a(n))) = 10. - _Reinhard Zumkeller_, Jul 29 2007
%F A130694 a(n) = n + 91 for n >= 78 (conjectured). - _Chai Wah Wu_, Jan 27 2020
%e A130694 2^68 = 295147905179352825856.
%t A130694 A2 := {}; Do[If[Length[Union[ IntegerDigits[2^ n]]] == 10, A2 = Join[A2, {n}]], {n, 1, 200}]; Print[A2]
%t A130694 Select[Range[200],Min[DigitCount[2^#]]>0&] (* _Harvey P. Dale_, Aug 03 2019 *)
%o A130694 (PARI) is_A130694(n)=9<#Set(Vec(Str(1<<n))) \\ _M. F. Hasler_, Aug 25 2012
%Y A130694 Cf. A007377, A000079.
%Y A130694 Complement of A130696.
%K A130694 nonn,base
%O A130694 1,1
%A A130694 _Greg Dresden_, Jul 10 2007
%E A130694 Displayed terms double-checked by _M. F. Hasler_, Aug 25 2012