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 A373074 #11 Aug 15 2024 17:11:37
%S A373074 1,0,0,0,1,1,1,1,1,1,1,1,1,1,2,2,3,3,4,4,5,5,6,6,7,7,8,8,9,9,11,11,13,
%T A373074 14,16,17,20,21,24,26,29,31,35,37,41,44,48,51,56,59,64,68,74,78,85,90,
%U A373074 98,104,113,120,131,139,151,161,175,186,202,215,233,248,268,285,308,327,352,374,402,426,457
%N A373074 Number of partitions of n such that (smallest part) > 3*(number of parts).
%F A373074 G.f.: Sum_{k>=0} x^(3*k^2+k)/Product_{j=1..k} (1-x^j).
%t A373074 Join[{1},Table[Count[IntegerPartitions[n],_?(#[[-1]]>3*Length[#]&)],{n,80}]] (* _Harvey P. Dale_, Aug 15 2024 *)
%o A373074 (PARI) my(N=80, x='x+O('x^N)); Vec(sum(k=0, N, x^(3*k^2+k)/prod(j=1, k, 1-x^j)))
%Y A373074 Cf. A003106, A373073, A373075, A373076.
%Y A373074 Cf. A350894, A373068.
%K A373074 nonn
%O A373074 0,15
%A A373074 _Seiichi Manyama_, May 22 2024