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 A324516 #6 Mar 07 2019 23:25:05
%S A324516 1,1,1,2,2,2,2,5,2,8,6,6,10,14,12,20,27,23,40,40,51,62,82,88,123,135,
%T A324516 173,197,253,285,350,419,497,594,708,855,978,1195,1395,1648,1915,2313,
%U A324516 2625,3170,3625,4336,4948,5900,6751,7970,9180,10704,12337,14436,16517
%N A324516 Number of integer partitions of n > 0 where the maximum part minus the minimum part equals the length minus the number of distinct parts.
%C A324516 The Heinz numbers of these integer partitions are given by A324515.
%e A324516 The a(8) = 5 through a(14) = 14 integer partitions:
%e A324516 (8) (9) (A) (B) (C) (D) (E)
%e A324516 (332) (32211) (433) (443) (4422) (544) (554)
%e A324516 (3311) (3331) (33221) (33321) (43222) (4442)
%e A324516 (32111) (4222) (44111) (422211) (52222) (5333)
%e A324516 (41111) (32221) (422111) (5211111) (422221) (43322)
%e A324516 (33211) (431111) (6111111) (433111) (44411)
%e A324516 (421111) (442111) (442211)
%e A324516 (511111) (4321111) (443111)
%e A324516 (5221111) (551111)
%e A324516 (5311111) (4322111)
%e A324516 (5222111)
%e A324516 (5411111)
%e A324516 (62111111)
%e A324516 (71111111)
%t A324516 Table[Length[Select[IntegerPartitions[n],Max@@#-Min@@#==Length[#]-Length[Union[#]]&]],{n,30}]
%Y A324516 Cf. A006141, A039900, A046660, A047993, A064174, A243055.
%Y A324516 Cf. A324515, A324518, A324520.
%K A324516 nonn
%O A324516 1,4
%A A324516 _Gus Wiseman_, Mar 06 2019