This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A237281 #13 Dec 20 2024 12:20:26
%S A237281 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 A237281 81,82,91,92,95,99,102,111,115,118,121,127,134,138,139,140,146,156,
%U A237281 159,161,164,165,166,168,169,173,177,178,182,183,188,192,196,201
%N A237281 Numbers k such that A000041(k) == 3 (mod 4).
%C A237281 The set of positive integers is partitioned by the sequences A237278-A237281.
%H A237281 Clark Kimberling, <a href="/A237281/b237281.txt">Table of n, a(n) for n = 1..1000</a>
%e A237281 A000041(6) = 11 == 3 (mod 4).
%t A237281 f[n_, k_] := Select[Range[250], Mod[PartitionsP[#], n] == k &]
%t A237281 Table[f[4, k], {k, 0, 3}] (* A237278-A237281 *)
%Y A237281 Cf. A000041, A237276, A237278, A237279, A237280.
%Y A237281 Cf. A121062.
%K A237281 nonn,easy
%O A237281 1,1
%A A237281 _Clark Kimberling_, Feb 05 2014