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 A241518 #4 Apr 29 2014 22:46:36
%S A241518 1,0,0,1,2,3,3,4,5,6,8,12,16,23,27,41,46,63,71,96,109,148,161,219,256,
%T A241518 332,379,500,580,738,859,1079,1250,1560,1791,2220,2563,3116,3595,4369,
%U A241518 5054,6080,7020,8418,9729,11617,13409,15911,18417,21713,25078,29467
%N A241518 Number of partitions p of n such that #m(1) = #m(2), where #m(i) = number of numbers in p that have multiplicity i.
%e A241518 a(6) counts these 3 partitions: 411, 222, 111111.
%t A241518 z = 30; u[p_] := Length[DeleteDuplicates[Select[p, Count[p, #] == 1 &]]]; v[p_] := Length[DeleteDuplicates[Select[p, Count[p, #] == 2 &]]]; Table[Count[IntegerPartitions[n], p_ /; u[p] == v[p]], {n, 0, z}]
%Y A241518 Cf. A241274.
%K A241518 nonn,easy
%O A241518 0,5
%A A241518 _Clark Kimberling_, Apr 24 2014