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 A237277 #12 Feb 09 2021 01:56:54
%S A237277 2,4,6,11,12,13,15,25,29,31,38,42,47,49,56,58,60,65,66,67,69,74,76,78,
%T A237277 79,83,84,85,87,90,92,93,94,96,101,103,105,108,109,114,120,121,123,
%U A237277 126,127,130,131,132,135,136,141,144,145,153,156,159,165,167,171
%N A237277 Numbers k such that A000041(k) == 2 (mod 3).
%C A237277 The set of positive integers is partitioned by A083214, A237276, and A237277.
%H A237277 Clark Kimberling, <a href="/A237277/b237277.txt">Table of n, a(n) for n = 1..1000</a>
%e A237277 A000041(6) = 11 == 2 (mod 3).
%t A237277 f[n_, k_] := Select[Range[250], Mod[PartitionsP[#], n] == k &]
%t A237277 Table[f[3, k], {k, 0, 2}] (* A083214, A237276, A237277 *)
%t A237277 Table[f[4, k], {k, 0, 3}] (* A237278-A237281 *)
%Y A237277 Cf. A000041, A083214, A237276.
%K A237277 nonn,easy
%O A237277 1,1
%A A237277 _Clark Kimberling_, Feb 05 2014