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 A035103 #21 Mar 03 2023 16:34:35
%S A035103 1,0,1,0,1,1,3,2,1,1,0,3,3,2,1,2,1,1,4,3,4,2,3,3,4,3,2,2,2,3,0,5,5,4,
%T A035103 4,3,3,4,3,3,3,3,1,5,4,3,3,1,3,3,3,1,3,1,7,5,5,4,5,5,4,5,4,3,4,3,4,5,
%U A035103 3,3,5,3,2,3,2,1,5,4,5,4,4,4,2,4,2,2,5,4,3,2,3,1,2,2,2,1,1,7,6,5,6,5,5,5,4
%N A035103 Number of 0's in binary representation of n-th prime.
%H A035103 Reinhard Zumkeller, <a href="/A035103/b035103.txt">Table of n, a(n) for n = 1..10000</a>
%F A035103 a(n) = A035100(n) - A014499(n). - _M. F. Hasler_, Nov 21 2009
%F A035103 a(n) = 0 for n in { A059305 }. - _Alois P. Heinz_, Jun 26 2021
%t A035103 Table[ Count[ IntegerDigits[ Prime[ n ], 2 ], 0 ], {n, 120} ]
%t A035103 Table[DigitCount[p,2,0],{p,Prime[Range[120]]}] (* _Harvey P. Dale_, Mar 03 2023 *)
%o A035103 (PARI) A035103(n) = #(n=binary(prime(n)))-norml2(n) \\ _M. F. Hasler_, Nov 21 2009
%o A035103 (Haskell)
%o A035103 a035103 = a023416 . a000040 -- _Reinhard Zumkeller_, Feb 19 2013
%Y A035103 Cf. A014499, A035100.
%Y A035103 Cf. A023416, A000040.
%Y A035103 Cf. A059305.
%K A035103 nonn,base,easy
%O A035103 1,7
%A A035103 _N. J. A. Sloane_
%E A035103 More terms from _Erich Friedman_