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 A237279 #14 Dec 20 2024 12:19:54
%S A237279 1,4,12,13,17,18,29,32,36,37,39,43,48,49,52,61,67,69,71,73,83,85,87,
%T A237279 88,89,90,93,104,105,107,114,119,123,132,143,144,145,148,150,152,155,
%U A237279 157,162,172,181,185,186,189,190,193,194,195,199,203,208,216,219
%N A237279 Numbers k such that A000041(k) == 1 (mod 4).
%C A237279 The set of positive integers is partitioned by the sequences A237278-A237281.
%H A237279 Clark Kimberling, <a href="/A237279/b237279.txt">Table of n, a(n) for n = 1..1000</a>
%e A237279 A000041(4) = 5 == 1 (mod 4).
%t A237279 f[n_, k_] := Select[Range[250], Mod[PartitionsP[#], n] == k &]
%t A237279 Table[f[4, k], {k, 0, 3}] (* A237278-A237281 *)
%Y A237279 Cf. A000041, A237276, A237278, A237280, A237281.
%Y A237279 Cf. A121062.
%K A237279 nonn,easy
%O A237279 1,2
%A A237279 _Clark Kimberling_, Feb 05 2014