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 A373073 #7 May 22 2024 11:33:14
%S A373073 1,0,0,1,1,1,1,1,1,1,2,2,3,3,4,4,5,5,6,6,7,8,9,10,12,13,15,17,19,21,
%T A373073 24,26,29,32,35,38,43,46,51,56,62,67,75,81,90,98,108,117,130,140,154,
%U A373073 167,183,197,216,233,254,274,298,321,350,376,408,440,477,513,556,598,647
%N A373073 Number of partitions of n such that (smallest part) > 2*(number of parts).
%F A373073 G.f.: Sum_{k>=0} x^(2*k^2+k)/Product_{j=1..k} (1-x^j).
%o A373073 (PARI) my(N=70, x='x+O('x^N)); Vec(sum(k=0, N, x^(2*k^2+k)/prod(j=1, k, 1-x^j)))
%Y A373073 Cf. A003106, A373074, A373075, A373076.
%Y A373073 Cf. A350893, A373067.
%K A373073 nonn
%O A373073 0,11
%A A373073 _Seiichi Manyama_, May 22 2024