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 A066195 #17 Apr 12 2019 18:53:07
%S A066195 3,2,19,17,67,131,523,257,1033,2053,4099,8209,16417,32771,65539,65537,
%T A066195 262147,524353,1048609,2097169,4194433,8388617,16777729,67108913,
%U A066195 67239937,134250497,268435459,536903681,1073741827,2147483713,8589934627,8589934609,17179869697
%N A066195 Smallest prime containing n zeros in its binary expansion.
%C A066195 A023416(a(n)) = n and A023416(m) <> n for m < A049084(a(m)).
%H A066195 Alois P. Heinz, <a href="/A066195/b066195.txt">Table of n, a(n) for n = 0..1000</a>
%t A066195 Do[ k = 1; While[ Count[ IntegerDigits[ Prime[ k ], 2 ], 0 ] != n, k++ ]; Print[ Prime[ k ] ], {n, 1, 24} ]
%o A066195 (Haskell)
%o A066195 import Data.List (find)
%o A066195 import Data.Maybe (fromJust)
%o A066195 a066195 n = fromJust $ find ((== n) . a023416) a000040_list
%o A066195 -- _Reinhard Zumkeller_, Feb 19 2013
%Y A066195 Cf. A061712.
%K A066195 base,nonn
%O A066195 0,1
%A A066195 _Robert G. Wilson v_, Dec 15 2001
%E A066195 a(25)-a(32) from _Alois P. Heinz_, Jun 28 2015