OFFSET
0,4
COMMENTS
Each number in p is counted once, regardless of its multiplicity.
EXAMPLE
a(6) counts these 5 partitions: 51, 33, 321, 3111, 111111.
MATHEMATICA
z = 30; f[n_] := f[n] = IntegerPartitions[n]; s0[p_] := Count[Mod[DeleteDuplicates[p], 2], 0];
s1[p_] := Count[Mod[DeleteDuplicates[p], 2], 1];
Table[Count[f[n], p_ /; 2 s0[p] < s1[p]], {n, 0, z}] (* A241651 *)
Table[Count[f[n], p_ /; 2 s0[p] <= s1[p]], {n, 0, z}] (* A241652 *)
Table[Count[f[n], p_ /; 2 s0[p] == s1[p]], {n, 0, z}] (* A241653 *)
Table[Count[f[n], p_ /; 2 s0[p] >= s1[p]], {n, 0, z}] (* A241654 *)
Table[Count[f[n], p_ /; 2 s0[p] > s1[p]], {n, 0, z}] (* A241655 *)
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Clark Kimberling, Apr 27 2014
STATUS
approved