|
%I #7 May 19 2014 10:41:52
%S 1,0,0,1,1,4,3,8,6,13,11,20,17,31,34,47,56,78,103,125,167,203,281,315,
%T 433,487,673,745,989,1101,1472,1623,2116,2386,3052,3430,4347,4948,
%U 6168,7104,8673,10068,12210,14234,17047,20007,23671,27869,32739,38609,45010
%N Number of partitions p of n such that (number of even numbers in p) = (number of odd numbers in p).
%C Each number in p is counted once, regardless of its multiplicity.
%H Alois P. Heinz, <a href="/A241638/b241638.txt">Table of n, a(n) for n = 0..1000</a>
%F a(n) = A241637(n) - A241636(n) = A241639(n) - A241640(n) for n >= 0.
%F a(n) + A241636(n) + A241640(n) = A000041(n) for n >= 0.
%F a(n) = A242618(n,0). - _Alois P. Heinz_, May 19 2014
%e a(6) counts these 3 partitions: 411, 2211, 21111.
%t z = 30; f[n_] := f[n] = IntegerPartitions[n]; s0[p_] := Count[Mod[DeleteDuplicates[p], 2], 0];
%t s1[p_] := Count[Mod[DeleteDuplicates[p], 2], 1];
%t Table[Count[f[n], p_ /; s0[p] < s1[p]], {n, 0, z}] (* A241636 *)
%t Table[Count[f[n], p_ /; s0[p] <= s1[p]], {n, 0, z}] (* A241637 *)
%t Table[Count[f[n], p_ /; s0[p] == s1[p]], {n, 0, z}] (* A241638 *)
%t Table[Count[f[n], p_ /; s0[p] >= s1[p]], {n, 0, z}] (* A241639 *)
%t Table[Count[f[n], p_ /; s0[p] > s1[p]], {n, 0, z}] (* A241640 *)
%Y Cf. A241636, A241637, A241639, A241640.
%K nonn,easy
%O 0,6
%A _Clark Kimberling_, Apr 27 2014
|
