%I #11 Feb 09 2021 01:57:28
%S 3,5,6,7,14,16,20,23,24,33,35,38,41,44,51,53,54,56,60,63,68,72,76,77,
%T 81,82,91,92,95,99,102,111,115,118,121,127,134,138,139,140,146,156,
%U 159,161,164,165,166,168,169,173,177,178,182,183,188,192,196,201
%N Numbers k such that A000041(k) == 3 (mod 4).
%C The set of positive integers is partitioned by the sequences A237278-A237281.
%H Clark Kimberling, <a href="/A237281/b237281.txt">Table of n, a(n) for n = 1..1000</a>
%e A000041(6) = 11 == 3 (mod 4).
%t f[n_, k_] := Select[Range[250], Mod[PartitionsP[#], n] == k &]
%t Table[f[4, k], {k, 0, 3}] (* A237278-A237281 *)
%Y Cf. A000041, A237276, A237278, A237279, A237280.
%K nonn,easy
%O 1,1
%A _Clark Kimberling_, Feb 05 2014