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!)
 A105022 Entries in the n-th row of Pascal's triangle that have the 2's bit set in their binary expansion. 0
 0, 0, 1, 2, 1, 2, 4, 4, 1, 2, 4, 8, 4, 8, 8, 8, 1, 2, 4, 8, 4, 8, 12, 16, 4, 8, 12, 16, 8, 16, 16, 16, 1, 2, 4, 8, 4, 8, 12, 16, 4, 8, 12, 24, 12, 24, 24, 32, 4, 8, 12, 16, 12, 24, 24, 32, 8, 16, 24, 32, 16, 32, 32, 32, 1, 2, 4, 8, 4, 8, 12, 16, 4, 8, 12, 24, 12, 24, 24, 32, 4, 8, 12, 24, 12, 24 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,4 COMMENTS 0's only occur for n=0 and 1, 1's only occur for n=2^k, 2's only occur for n=1+2^k, etc. - Robert G. Wilson v, Apr 01 2005 LINKS MATHEMATICA PascalTwosBitCount[m_] := Plus @@ Table[BitAnd[Binomial[m, k], 2]/ 2, {k, 0, m}] CROSSREFS Cf. A104176. Sequence in context: A323460 A129144 A295313 * A263293 A230535 A349741 Adjacent sequences: A105019 A105020 A105021 * A105023 A105024 A105025 KEYWORD easy,nonn AUTHOR Jacob A. Siehler, Apr 03 2005 EXTENSIONS More terms from Robert G. Wilson v, Apr 01 2005 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 8 06:47 EST 2022. Contains 358673 sequences. (Running on oeis4.)