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 A237799 #8 Feb 22 2014 13:20:39
%S A237799 1,1,1,2,2,4,4,6,7,9,10,14,15,19,23,28,32,40,46,56,65,77,89,107,122,
%T A237799 143,165,193,220,257,292,338,385,443,503,578,653,746,844,962,1083,
%U A237799 1231,1384,1567,1761,1987,2227,2510,2807,3153,3523,3949,4403,4927,5485
%N A237799 Number of partitions of n such that 2*(least part) > number of parts.
%e A237799 a(7) = 4 counts these partitions: 7, 52, 43, 322.
%t A237799 z = 55; q[n_] := q[n] = IntegerPartitions[n]; t[p_] := Length[p];
%t A237799 Table[Count[q[n], p_ /; 2 Min[p] < t[p]], {n, z}] (* A237758 *)
%t A237799 Table[Count[q[n], p_ /; 2 Min[p] == t[p]], {n, z}] (* A237757 *)
%t A237799 Table[Count[q[n], p_ /; 2 Min[p] > t[p]], {n, z}] (* A237799 *)
%t A237799 Table[Count[q[n], p_ /; 2 Min[p] >= t[p]], {n, z}] (* A237800 *)
%Y A237799 Cf. A237758, A118084, A237757, A237800.
%K A237799 nonn,easy
%O A237799 1,4
%A A237799 _Clark Kimberling_, Feb 15 2014