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 A239962 #6 Apr 04 2014 13:29:50
%S A239962 1,1,1,1,2,2,3,3,6,4,10,9,12,16,23,21,34,42,45,64,76,92,113,144,166,
%T A239962 214,247,308,365,459,523,642,774,922,1094,1304,1556,1830,2191,2573,
%U A239962 3039,3570,4242,4911,5859,6756,8000,9244,10916,12581,14780,17048,19894
%N A239962 Number of partitions of n such that (number of distinct parts) = multiplicity of the least part.
%e A239962 a(8) counts these 6 partitions: 611, 44, 422, 3311, 32111, 2222.
%t A239962 z = 54; d[p_] := d[p] = Length[DeleteDuplicates[p]]; Table[Count[IntegerPartitions[n], p_ /; d[p] == Count[p, Min[p]]], {n, 0, z}]
%Y A239962 Cf. A239960.
%K A239962 nonn,easy
%O A239962 0,5
%A A239962 _Clark Kimberling_, Mar 30 2014