The OEIS is supported by the many generous donors to the OEIS Foundation.

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A035103 Number of 0's in binary representation of n-th prime. 17
 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, 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, 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 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,7 LINKS Reinhard Zumkeller, Table of n, a(n) for n = 1..10000 FORMULA a(n) = A035100(n) - A014499(n). - M. F. Hasler, Nov 21 2009 a(n) = 0 for n in { A059305 }. - Alois P. Heinz, Jun 26 2021 MATHEMATICA Table[ Count[ IntegerDigits[ Prime[ n ], 2 ], 0 ], {n, 120} ] PROG (PARI) A035103(n) = #(n=binary(prime(n)))-norml2(n) \\ M. F. Hasler, Nov 21 2009 (Haskell) a035103 = a023416 . a000040 -- Reinhard Zumkeller, Feb 19 2013 CROSSREFS Cf. A014499, A035100. Cf. A023416, A000040. Cf. A059305. Sequence in context: A129267 A199324 A287576 * A155033 A283417 A107889 Adjacent sequences: A035100 A035101 A035102 * A035104 A035105 A035106 KEYWORD nonn,base,easy AUTHOR EXTENSIONS More terms from Erich Friedman STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 2 05:15 EST 2022. Contains 358485 sequences. (Running on oeis4.)