login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A035538
Number of partitions of n with equal nonzero number of parts congruent to each of 0 and 2 (mod 3)
0
0, 0, 0, 0, 0, 1, 1, 1, 3, 4, 5, 8, 11, 14, 19, 26, 34, 43, 56, 72, 90, 114, 145, 178, 222, 277, 338, 414, 511, 619, 751, 913, 1101, 1324, 1595, 1909, 2282, 2724, 3243, 3850, 4569, 5406, 6387, 7530, 8869, 10423, 12231, 14332, 16775, 19591, 22864, 26643, 31000
OFFSET
0,9
MATHEMATICA
equalQ[partit_] := With[{ t = Total[Switch[Mod[#, 3], 0, {1, 0, 0}, 1, {0, 1, 0}, 2, {0, 0, 1}]& /@ partit]}, t[[1]] > 0 && t[[1]] == t[[3]]]; a[n_] := Select[IntegerPartitions[n], equalQ] // Length; a[0] = 0; Table[an = a[n]; Print["a(", n, ") = ", an]; an, {n, 0, 52}] (* Jean-François Alcover, Dec 07 2016 *)
CROSSREFS
Sequence in context: A047599 A332414 A050846 * A039881 A364652 A035113
KEYWORD
nonn
STATUS
approved