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 A237280 #14 Dec 20 2024 12:20:05
%S A237280 2,8,9,10,19,22,25,27,28,31,34,40,42,45,46,47,50,57,64,65,79,86,97,
%T A237280 101,103,110,129,147,151,158,160,163,167,170,174,175,176,184,197,198,
%U A237280 207,213,217,224,227,228,241,245,246,247
%N A237280 Numbers k such that A000041(k) == 2 (mod 4).
%C A237280 The set of positive integers is partitioned by the sequences A237278-A237281.
%H A237280 Clark Kimberling, <a href="/A237280/b237280.txt">Table of n, a(n) for n = 1..1000</a>
%e A237280 A000041(8) = 22 == 2 (mod 4).
%t A237280 f[n_, k_] := Select[Range[250], Mod[PartitionsP[#], n] == k &]
%t A237280 Table[f[4, k], {k, 0, 3}] (* A237278-A237281 *)
%Y A237280 Cf. A000041, A237276, A237278, A237279, A237281.
%Y A237280 Cf. A121062.
%K A237280 nonn,easy
%O A237280 1,1
%A A237280 _Clark Kimberling_, Feb 05 2014