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 A240184 #8 Apr 12 2014 16:22:11
%S A240184 0,0,1,2,2,5,6,11,14,20,29,41,52,76,98,130,170,227,288,378,477,615,
%T A240184 778,985,1228,1551,1928,2399,2964,3670,4498,5538,6755,8251,10027,
%U A240184 12175,14715,17802,21420,25764,30886,37009,44181,52731,62730,74570,88435,104762
%N A240184 Number of partitions of n such that (greatest part) > (multiplicity of least part).
%F A240184 A240178(n) + A240183(n) + a(n ) = A000041(n) for n >= 1.
%e A240184 a(6) counts these 6 partitions: 6, 51, 42, 411, 33, 321.
%t A240184 z = 60; f[n_] := f[n] = IntegerPartitions[n];
%t A240184 t1 = Table[Count[f[n], p_ /; Max[p] < Count[p, Min[p]]], {n, 0, z}] (* A240178 *)
%t A240184 t2 = Table[Count[f[n], p_ /; Max[p] <= Count[p, Min[p]]], {n, 0, z}] (* A240182 *)
%t A240184 t3 = Table[Count[f[n], p_ /; Max[p] == Count[p, Min[p]]], {n, 0, z}] (* A240183 *)
%t A240184 t4 = Table[Count[f[n], p_ /; Max[p] > Count[p, Min[p]]], {n, 0, z}] (* A240184 *)
%t A240184 t5 = Table[Count[f[n], p_ /; Max[p] >= Count[p, Min[p]]], {n, 0, z}] (* A240179 *)
%Y A240184 Cf. A240178, A240182, A240183, A240179, A000041.
%K A240184 nonn,easy
%O A240184 0,4
%A A240184 _Clark Kimberling_, Apr 02 2014