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 A240303 #6 Apr 12 2014 16:25:27
%S A240303 0,1,2,3,5,6,11,13,19,26,37,44,66,80,108,139,182,226,298,366,474,588,
%T A240303 742,911,1154,1408,1751,2143,2642,3205,3944,4761,5805,6998,8479,10177,
%U A240303 12285,14679,17620,21014,25114,29822,35529,42057,49894,58927,69644,81994
%N A240303 Number of partitions of n such that (maximal multiplicity of parts) = (multiplicity of the least part).
%F A240303 a(n) + A240304(n) = A000041(n) for n >= 1.
%e A240303 a(7) counts all the 15 partitions of 7 except 331 and 2221, so that a(7) = 13.
%t A240303 z = 60; f[n_] := f[n] = IntegerPartitions[n]; m[p_] := Max[Map[Length, Split[p]]] (* maximal multiplicity *)
%t A240303 Table[Count[f[n], p_ /; m[p] == Count[p, Min[p]]], {n, 0, z}] (* A240303 *)
%t A240303 Table[Count[f[n], p_ /; m[p] > Count[p, Min[p]]], {n, 0, z}] (* A240304 *)
%Y A240303 Cf. A240304, A000041, A171979.
%K A240303 nonn,easy
%O A240303 0,3
%A A240303 _Clark Kimberling_, Apr 04 2014