|
%I #15 Dec 03 2022 13:06:13
%S 0,1,3,7,13,23,41,65,102,156,234,340,495,697,982,1359,1864,2523,3408,
%T 4536,6022,7918,10365,13457,17423,22380,28666,36498,46318,58466,73617,
%U 92221,115236,143402,177984,220086,271524,333810,409490,500804,611149,743728,903296
%N Number of 1's in binary expansion of parts in all partitions of n.
%H Alois P. Heinz, <a href="/A066624/b066624.txt">Table of n, a(n) for n = 0..8000</a>
%e For n = 3: 11 = 10+1 = 1+1+1 [binary expansion of partitions of 3]. a(3) = (two 1's) + (two 1's) + (three 1's), so a(3) = 7.
%t << DiscreteMath`Combinatorica`; Table[Count[Flatten[IntegerDigits[Partitions[n], 2]], 1], {n, 0, 50}]
%t Table[Total[Flatten[IntegerDigits[#,2]&/@IntegerPartitions[n]]],{n,0,50}] (* _Harvey P. Dale_, Mar 29 2022 *)
%Y Cf. A000120, A000070, A347060.
%K easy,nonn,base
%O 0,3
%A _Naohiro Nomoto_, Jan 09 2002
%E More terms from _Vladeta Jovovic_ and _Robert G. Wilson v_, Jan 11 2002
|
