|
%I #5 Mar 31 2012 23:01:22
%S 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,
%T 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,
%U 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
%N Entries in the n-th row of Pascal's triangle that have the 2's bit set in their binary expansion.
%C 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
%t PascalTwosBitCount[m_] := Plus @@ Table[BitAnd[Binomial[m, k], 2]/ 2, {k, 0, m}]
%Y Cf. A104176.
%K easy,nonn
%O 0,4
%A _Jacob A. Siehler_, Apr 03 2005
%E More terms from _Robert G. Wilson v_, Apr 01 2005
|
