%I #12 Feb 09 2021 01:57:01
%S 1,4,12,13,17,18,29,32,36,37,39,43,48,49,52,61,67,69,71,73,83,85,87,
%T 88,89,90,93,104,105,107,114,119,123,132,143,144,145,148,150,152,155,
%U 157,162,172,181,185,186,189,190,193,194,195,199,203,208,216,219
%N Numbers k such that A000041(k) == 1 (mod 4).
%C The set of positive integers is partitioned by the sequences A237278-A237281.
%H Clark Kimberling, <a href="/A237279/b237279.txt">Table of n, a(n) for n = 1..1000</a>
%e A000041(4) = 5 == 1 (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, A237280, A237281.
%K nonn,easy
%O 1,2
%A _Clark Kimberling_, Feb 05 2014
|