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 A239964 #6 Apr 04 2014 13:30:05
%S A239964 0,1,1,1,2,3,3,4,6,5,11,12,15,21,26,30,41,52,56,82,99,118,144,189,221,
%T A239964 279,327,405,491,600,699,860,1038,1230,1470,1754,2106,2487,2970,3489,
%U A239964 4148,4883,5779,6763,8024,9284,11006,12780,15029,17452,20405,23660
%N A239964 Number of partitions of n such that (number of distinct parts) = maximal multiplicity of the parts.
%e A239964 a(8) counts these partitions: 8, 611, 422, 332, 3311, 32111.
%t A239964 z = 58; d[p_] := d[p] = Length[DeleteDuplicates[p]]; m[p_] := Max[Map[Length, Split[p]]]; Table[Count[IntegerPartitions[n], p_ /; d[p] == m[p]], {n, 0, z}]
%Y A239964 Cf. A239948, A239966.
%K A239964 nonn,easy
%O A239964 0,5
%A A239964 _Clark Kimberling_, Mar 30 2014