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 A239966 #4 Apr 04 2014 13:30:15
%S A239966 0,1,1,1,1,1,2,2,4,3,6,5,8,6,13,6,15,10,19,12,24,15,33,22,38,28,52,39,
%T A239966 61,51,78,66,94,85,118,103,140,130,168,165,194,190,244,230,274,285,
%U A239966 328,327,394,386,449,485,522,540,646,639,712,790,846,880,1025
%N A239966 Number of partitions of n such that (number of distinct parts) = minimal multiplicity of the parts.
%e A239966 a(8) counts these 4 partitions : 8, 3311, 22211, 221111.
%t A239966 z = 61; d[p_] := d[p] = Length[DeleteDuplicates[p]]; m[p_] := Min[Map[Length, Split[p]]]; Table[Count[IntegerPartitions[n], p_ /; d[p] == m[p]], {n, 0, z}]
%Y A239966 Cf. A239964, A239948.
%K A239966 nonn,easy
%O A239966 0,7
%A A239966 _Clark Kimberling_, Mar 30 2014