OFFSET
0,5
COMMENTS
Each number in p is counted once, regardless of its multiplicity.
EXAMPLE
a(8) counts these 9 partitions: 71, 611, 44, 431, 4211, 3311, 311111, 11111111.
MATHEMATICA
z = 40; f[n_] := f[n] = IntegerPartitions[n]; s[k_, p_] := Count[Mod[DeleteDuplicates[p], 3], k];
Table[Count[f[n], p_ /; s[1, p] < s[2, p]], {n, 0, z}] (* A241737 *)
Table[Count[f[n], p_ /; s[1, p] == s[2, p]], {n, 0, z}] (* A241738 *)
Table[Count[f[n], p_ /; s[1, p] > s[2, p]], {n, 0, z}] (* A241739 *)
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Clark Kimberling, Apr 28 2014
STATUS
approved