OFFSET
0,10
COMMENTS
Each number in p is counted once, regardless of its multiplicity.
FORMULA
EXAMPLE
a(9) counts these 4 partitions: 621, 432, 4221, 42111.
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_ /; s0[p] < 2 s1[p]], {n, 0, z}] (* A241641 *)
Table[Count[f[n], p_ /; s0[p] <= 2 s1[p]], {n, 0, z}] (* A241642 *)
Table[Count[f[n], p_ /; s0[p] == 2 s1[p]], {n, 0, z}] (* A241643 *)
Table[Count[f[n], p_ /; s0[p] >= 2 s1[p]], {n, 0, z}] (* A241644 *)
Table[Count[f[n], p_ /; s0[p] > 2 s1[p]], {n, 0, z}] (* A241645 *)
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Clark Kimberling, Apr 27 2014
STATUS
approved