OFFSET
0,5
COMMENTS
Each number in p is counted once, regardless of its multiplicity.
EXAMPLE
a(8) counts these 9 partitions: 8, 521, 5111, 422, 4211, 2222, 22211, 221111, 2111111.
MATHEMATICA
z = 40; f[n_] := f[n] = IntegerPartitions[n]; s[k_, p_] := Count[Mod[DeleteDuplicates[p], 3], k];
Table[Count[f[n], p_ /; s[2, p] < s[0, p]], {n, 0, z}] (* A241740 *)
Table[Count[f[n], p_ /; s[2, p] == s[0, p]], {n, 0, z}] (* A241741 *)
Table[Count[f[n], p_ /; s[2, p] > s[0, p]], {n, 0, z}] (* A241742 *)
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Clark Kimberling, Apr 28 2014
STATUS
approved