|
%I #4 May 03 2019 21:25:59
%S 1,2,3,4,5,6,7,9,10,11,13,14,15,17,18,19,21,22,23,25,26,29,31,33,34,
%T 35,37,38,39,41,43,46,47,49,50,51,53,55,57,58,59,61,62,65,67,69,70,71,
%U 73,74,75,77,79,82,83,85,86,87,89,91,93,94,95,97,98
%N Heinz numbers of integer partitions with strictly decreasing differences.
%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 (6,3,1) are (-3,-2).
%C The enumeration of these partitions by sum is given by A320470.
%H Gus Wiseman, <a href="/A325325/a325325.txt">Sequences counting and ranking integer partitions by the differences of their successive parts.</a>
%e The sequence of terms together with their prime indices begins:
%e 1: {}
%e 2: {1}
%e 3: {2}
%e 4: {1,1}
%e 5: {3}
%e 6: {1,2}
%e 7: {4}
%e 9: {2,2}
%e 10: {1,3}
%e 11: {5}
%e 12: {1,1,2}
%e 13: {6}
%e 14: {1,4}
%e 15: {2,3}
%e 17: {7}
%e 19: {8}
%e 20: {1,1,3}
%e 21: {2,4}
%e 22: {1,5}
%e 23: {9}
%t primeptn[n_]:=If[n==1,{},Reverse[Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]]];
%t Select[Range[100],Greater@@Differences[primeptn[#]]&]
%Y Cf. A056239, A112798, A320470, A320510, A325328, A325352, A325360, A325361, A325368, A325399, A325456, A325461, A320470, A325396.
%K nonn
%O 1,2
%A _Gus Wiseman_, May 03 2019
|
