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 A237751 #11 Jan 24 2022 04:40:21
%S A237751 0,0,1,1,1,2,3,4,6,8,10,14,18,24,32,41,52,67,85,107,135,169,210,263,
%T A237751 324,400,493,604,736,899,1091,1322,1599,1929,2319,2787,3336,3989,4760,
%U A237751 5669,6734,7994,9465,11192,13211,15571,18319,21531,25257,29594,34626
%N A237751 Number of partitions of n such that 2*(greatest part) < (number of parts).
%C A237751 Also, the number of partitions of n such that (greatest part) > 2*(number of parts); hence, the number of partitions of n such that (rank + greatest part) < 0.
%H A237751 Seiichi Manyama, <a href="/A237751/b237751.txt">Table of n, a(n) for n = 1..1000</a>
%F A237751 a(n) = A000041(n) - A237755(n).
%e A237751 a(6) = 2 counts these partitions: 21111, 111111.
%t A237751 z = 55; Table[Count[IntegerPartitions[n], p_ /; 2 Max[p] < Length[p]], {n, z}]
%Y A237751 Cf. A064173, A237752-A237757, A000041.
%K A237751 nonn,easy
%O A237751 1,6
%A A237751 _Clark Kimberling_, Feb 13 2014