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 A373013 #12 May 20 2024 08:57:11
%S A373013 0,0,1,1,0,1,1,1,3,3,3,5,5,5,8,9,9,13,15,17,23,26,29,36,41,46,57,64,
%T A373013 72,87,98,111,131,149,168,197,223,251,291,328,369,423,476,534,609,683,
%U A373013 765,867,970,1084,1222,1365,1522,1710,1905,2121,2374,2639,2931,3269,3627,4020,4471,4950
%N A373013 Number of distinct partitions p of n such that max(p) == 2 mod 3.
%F A373013 G.f.: Sum_{k>=0} x^(3*k+2) * Product_{j=1..3*k+1} (1+x^j).
%F A373013 A000009(n) = A372893(n) + A373012(n) + a(n).
%e A373013 a(8) = 3 counts these partitions: 8, 53, 521.
%o A373013 (PARI) my(N=70, x='x+O('x^N)); concat([0, 0], Vec(sum(k=0, N, x^(3*k+2)*prod(j=1, 3*k+1, 1+x^j))))
%Y A373013 Cf. A000009, A372893, A373012.
%K A373013 nonn
%O A373013 0,9
%A A373013 _Seiichi Manyama_, May 20 2024