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 A325333 #4 May 02 2019 08:53:25
%S A325333 1,1,2,3,5,7,11,14,19,23,32,39,50,63,82,96,125,152,186,226,271,326,
%T A325333 392,473,552,663,771,918,1065,1261,1448,1710,1953,2283,2608,3062,3455,
%U A325333 4013,4552,5271,5974,6884,7774,8937,10065,11570,12953,14838,16710,18979
%N A325333 Number of integer partitions of n whose multiplicities all appear the same number of times.
%e A325333 The a(0) = 1 through a(7) = 14 partitions:
%e A325333 () (1) (2) (3) (4) (5) (6) (7)
%e A325333 (11) (21) (22) (32) (33) (43)
%e A325333 (111) (31) (41) (42) (52)
%e A325333 (211) (221) (51) (61)
%e A325333 (1111) (311) (222) (322)
%e A325333 (2111) (321) (331)
%e A325333 (11111) (411) (421)
%e A325333 (2211) (511)
%e A325333 (3111) (2221)
%e A325333 (21111) (4111)
%e A325333 (111111) (22111)
%e A325333 (31111)
%e A325333 (211111)
%e A325333 (1111111)
%e A325333 For example, the partition (4,3,3,3,2,2,2,1) has multiplicities (1,3,3,1), and since both multiplicities 1 and 3 appear twice, (4,3,3,3,2,2,2,1) is counted under a(20).
%t A325333 Table[Length[Select[IntegerPartitions[n],SameQ@@Length/@Split[Sort[Length/@Split[#]]]&]],{n,0,30}]
%Y A325333 Cf. A000041, A007862, A047966, A049988, A098859, A323022, A325329, A325369.
%K A325333 nonn
%O A325333 0,3
%A A325333 _Gus Wiseman_, May 01 2019