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 A237278 #18 Dec 20 2024 12:19:42
%S A237278 11,15,21,26,30,55,58,59,62,66,70,74,75,78,80,84,94,96,98,100,106,108,
%T A237278 109,112,113,116,117,120,122,124,125,126,128,130,131,133,135,136,137,
%U A237278 141,142,149,153,154,171,179,180,187,191,200,205,206,230,231,236
%N A237278 Numbers k such that A000041(k) == 0 (mod 4).
%C A237278 The set of positive integers is partitioned by the sequences A237278-A237281.
%H A237278 Clark Kimberling, <a href="/A237278/b237278.txt">Table of n, a(n) for n = 1..1000</a>
%e A237278 A000041(11) = 56 == 0 (mod 4).
%t A237278 f[n_, k_] := Select[Range[250], Mod[PartitionsP[#], n] == k &]
%t A237278 Table[f[4, k], {k, 0, 3}] (* A237278-A237281 *)
%o A237278 (PARI) is(n)=numbpart(n)%4==0 \\ _Charles R Greathouse IV_, Apr 08 2015
%Y A237278 Cf. A000041, A237276, A237279, A237280, A237281, A243935 (see crossrefs).
%Y A237278 Cf. A121062.
%K A237278 nonn,easy
%O A237278 1,1
%A A237278 _Clark Kimberling_, Feb 05 2014