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 A373067 #14 May 22 2024 11:33:18
%S A373067 1,0,1,1,1,1,1,1,2,2,3,3,4,4,5,5,6,6,8,8,10,11,13,14,17,18,21,23,26,
%T A373067 28,32,34,39,42,47,51,58,62,70,76,85,92,103,111,124,134,148,160,177,
%U A373067 190,210,226,248,267,293,315,345,371,405,436,476,511,557,599,651,700,760,816
%N A373067 Number of partitions of n such that (smallest part) >= 2*(number of parts).
%F A373067 G.f.: Sum_{k>=0} x^(2*k^2)/Product_{j=1..k} (1-x^j).
%o A373067 (PARI) my(N=70, x='x+O('x^N)); Vec(sum(k=0, N, x^(2*k^2)/prod(j=1, k, 1-x^j)))
%Y A373067 Cf. A003114, A373068, A373069, A373070.
%Y A373067 Cf. A069910, A350893, A373073.
%K A373067 nonn
%O A373067 0,9
%A A373067 _Seiichi Manyama_, May 22 2024