%N Heinz numbers of integer partitions whose differences (with the last part taken to be zero) are weakly decreasing.
%C The Heinz number of an integer partition (y_1,...,y_k) is prime(y_1)*...*prime(y_k).
%C The differences of a sequence are defined as if the sequence were increasing, so for example the differences of (x, y, z) are (y - x, z - y). We adhere to this standard for integer partitions also even though they are always weakly decreasing. For example, the differences of (6,3,1) (with the last part taken to be 0) are (-3,-2,-1).
%C The enumeration of these partitions by sum is given by A320509.
%H Gus Wiseman, <a href="/A325325/a325325.txt">Sequences counting and ranking integer partitions by the differences of their successive parts.</a>
%Y Cf. A056239, A112798, A320348, A320466, A320509, A325327, A325361, A325364, A325367, A325389, A325390, A325397.
%A _Gus Wiseman_, May 02 2019