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 A372893 #20 May 20 2024 08:57:03
%S A372893 1,0,0,1,1,1,2,1,1,3,3,4,6,6,7,10,11,12,16,17,20,26,29,34,42,47,54,66,
%T A372893 74,85,101,113,129,151,170,193,224,252,286,329,370,418,478,536,603,
%U A372893 686,767,862,974,1088,1218,1370,1527,1704,1910,2124,2366,2643,2934,3260,3631
%N A372893 Number of distinct partitions p of n such that max(p) == 0 mod 3.
%F A372893 G.f.: Sum_{k>=0} x^(3*k) * Product_{j=1..3*k-1} (1+x^j).
%F A372893 A000009(n) = a(n) + A373012(n) + A373013(n).
%e A372893 a(9) = 3 counts these partitions: 9, 63, 621.
%Y A372893 Column 3 of A373029.
%Y A372893 Cf. A000009, A373012, A373013.
%Y A372893 Cf. A026838, A363045.
%K A372893 nonn
%O A372893 0,7
%A A372893 _Seiichi Manyama_, May 20 2024