login
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
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
MATHEMATICA
PascalTwosBitCount[m_] := Plus @@ Table[BitAnd[Binomial[m, k], 2]/ 2, {k, 0, m}]
CROSSREFS
Cf. A104176.
Sequence in context: A129144 A360594 A295313 * A263293 A230535 A349741
KEYWORD
easy,nonn
AUTHOR
Jacob A. Siehler, Apr 03 2005
EXTENSIONS
More terms from Robert G. Wilson v, Apr 01 2005
STATUS
approved