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 A240055 #8 Dec 14 2014 14:01:51
%S A240055 1,1,0,0,0,2,1,1,3,2,4,5,7,6,14,11,17,22,30,28,45,55,61,78,103,114,
%T A240055 147,183,202,269,316,372,446,565,631,778,935,1096,1283,1586,1791,2166,
%U A240055 2558,2991,3478,4182,4821,5616,6660,7716,8933,10532,12155,14058,16482
%N A240055 Number of partitions of n such that (number of distinct parts) = m(1) - m(2), where m = multiplicity.
%e A240055 a(10) counts these 4 partitions: 622, 4411, 43111, 421111.
%t A240055 z = 58; d[p_] := d[p] = Length[DeleteDuplicates[p]]; Table[Count[IntegerPartitions[n], p_ /; d[p] == Count[p, 1] - Count[p, 2]], {n, 0, z}]
%Y A240055 Cf. A240056.
%K A240055 nonn,easy
%O A240055 0,6
%A A240055 _Clark Kimberling_, Mar 31 2014