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 A373069 #13 May 22 2024 11:33:30
%S A373069 1,0,0,0,1,1,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,10,
%T A373069 10,11,11,13,13,15,16,18,19,22,23,26,28,31,33,37,39,43,46,50,53,58,61,
%U A373069 66,70,75,79,85,89,95,100,107,112,120,126,135,142,152,160,172,181,194,205,220,232,249,263
%N A373069 Number of partitions of n such that (smallest part) >= 4*(number of parts).
%F A373069 G.f.: Sum_{k>=0} x^(4*k^2)/Product_{j=1..k} (1-x^j).
%o A373069 (PARI) my(N=80, x='x+O('x^N)); Vec(sum(k=0, N, x^(4*k^2)/prod(j=1, k, 1-x^j)))
%Y A373069 Cf. A003114, A373067, A373068, A373070.
%Y A373069 Cf. A350898, A373075.
%K A373069 nonn
%O A373069 0,17
%A A373069 _Seiichi Manyama_, May 22 2024