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”).
%I #12 Feb 09 2021 01:56:54
%S 2,4,6,11,12,13,15,25,29,31,38,42,47,49,56,58,60,65,66,67,69,74,76,78,
%T 79,83,84,85,87,90,92,93,94,96,101,103,105,108,109,114,120,121,123,
%U 126,127,130,131,132,135,136,141,144,145,153,156,159,165,167,171
%N Numbers k such that A000041(k) == 2 (mod 3).
%C The set of positive integers is partitioned by A083214, A237276, and A237277.
%H Clark Kimberling, <a href="/A237277/b237277.txt">Table of n, a(n) for n = 1..1000</a>
%e A000041(6) = 11 == 2 (mod 3).
%t f[n_, k_] := Select[Range[250], Mod[PartitionsP[#], n] == k &]
%t Table[f[3, k], {k, 0, 2}] (* A083214, A237276, A237277 *)
%t Table[f[4, k], {k, 0, 3}] (* A237278-A237281 *)
%Y Cf. A000041, A083214, A237276.
%K nonn,easy
%O 1,1
%A _Clark Kimberling_, Feb 05 2014