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 A237276 #22 May 22 2025 06:54:52
%S A237276 0,1,5,8,18,19,23,27,28,34,36,37,44,45,50,54,55,59,62,64,72,73,77,81,
%T A237276 82,86,89,91,95,98,99,100,110,112,113,116,117,118,119,122,128,134,137,
%U A237276 139,140,143,146,148,149,150,152,154,155,157,158,161,166,168,170
%N A237276 Numbers k such that A000041(k) == 1 (mod 3).
%C A237276 The set of positive integers is partitioned by A083214, A237276, and A237277.
%H A237276 Amiram Eldar, <a href="/A237276/b237276.txt">Table of n, a(n) for n = 1..10000</a> (terms 1..1000 from Clark Kimberling)
%e A237276 A000041(8) = 22 == 1 (mod 3).
%t A237276 f[n_, k_] := Select[Range[0, 250], Mod[PartitionsP[#], n] == k &]
%t A237276 Table[f[3, k], {k, 0, 2}] (* A083214, A237276, A237277 *)
%t A237276 Table[f[4, k], {k, 0, 3}] (* A237278-A237281 *)
%Y A237276 Cf. A000041, A083214, A237276, A237277.
%K A237276 nonn,easy
%O A237276 1,3
%A A237276 _Clark Kimberling_, Feb 05 2014
%E A237276 a(1)=0 inserted by _Amiram Eldar_, May 22 2025