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 A325707 #5 May 18 2019 22:46:44
%S A325707 1,1,0,1,1,1,2,1,2,2,4,4,5,6,7,8,10,11,13,16,18,23,26,32,36,43,48,57,
%T A325707 64,74,84,98,110,127,145,165,189,215,244,277,316,356,403,455,513,577,
%U A325707 650,727,817,913,1024,1143,1279,1425,1592,1773,1977,2198,2448,2717
%N A325707 Number of integer partitions of n covering an initial interval of positive integers and containing all of their distinct multiplicities.
%C A325707 The Heinz numbers of these partitions are given by A325708.
%e A325707 The initial terms count the following partitions:
%e A325707 1: (1)
%e A325707 3: (21)
%e A325707 4: (211)
%e A325707 5: (221)
%e A325707 6: (321)
%e A325707 6: (2211)
%e A325707 7: (3211)
%e A325707 8: (3221)
%e A325707 8: (32111)
%e A325707 9: (3321)
%e A325707 9: (32211)
%e A325707 10: (4321)
%e A325707 10: (33211)
%e A325707 10: (32221)
%e A325707 10: (322111)
%e A325707 11: (43211)
%e A325707 11: (33221)
%e A325707 11: (332111)
%e A325707 11: (322211)
%e A325707 12: (43221)
%e A325707 12: (432111)
%e A325707 12: (33321)
%e A325707 12: (332211)
%e A325707 12: (3222111)
%t A325707 Table[Length[Select[IntegerPartitions[n],Range[Length[Union[#]]]==Union[#]&&SubsetQ[Sort[#],Sort[Length/@Split[#]]]&]],{n,0,30}]
%Y A325707 Cf. A000009 (partitions covering an initial interval), A055932, A109297, A114639, A114640, A290689, A324753, A325702, A325706, A325708.
%K A325707 nonn
%O A325707 0,7
%A A325707 _Gus Wiseman_, May 18 2019