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 A373068 #15 May 22 2024 11:33:26
%S A373068 1,0,0,1,1,1,1,1,1,1,1,1,2,2,3,3,4,4,5,5,6,6,7,7,8,8,9,10,11,12,14,15,
%T A373068 17,19,21,23,26,28,31,34,37,40,44,47,51,55,59,63,69,73,79,85,92,98,
%U A373068 107,114,124,133,144,154,168,179,194,208,225,240,260,277,299,319,343,365,393,417,447,476
%N A373068 Number of partitions of n such that (smallest part) >= 3*(number of parts).
%F A373068 G.f.: Sum_{k>=0} x^(3*k^2)/Product_{j=1..k} (1-x^j).
%o A373068 (PARI) my(N=80, x='x+O('x^N)); Vec(sum(k=0, N, x^(3*k^2)/prod(j=1, k, 1-x^j)))
%Y A373068 Cf. A003114, A373067, A373069, A373070.
%Y A373068 Cf. A350894, A373074.
%K A373068 nonn
%O A373068 0,13
%A A373068 _Seiichi Manyama_, May 22 2024