%I #20 Oct 06 2025 03:01:36
%S 1,2,3,4,5,6,8,7,9,10,12,16,11,15,14,18,20,24,32,13,25,21,27,22,30,28,
%T 36,40,48,64,17,35,33,45,26,50,42,54,44,60,56,72,80,96,128,19,49,55,
%U 39,75,63,81,34,70,66,90,52,100,84,108,88,120,112,144,160,192,256
%N Heinz numbers of all reversed integer partitions sorted first by sum and then reverse-lexicographically.
%C First differs from A334435 at a(22) = 27, A334435(22) = 22.
%C A permutation of the positive integers.
%C Reversed integer partitions are finite weakly increasing sequences of positive integers. For non-reversed partitions, see A129129 and A228531.
%C This is the so-called "Mathematica" order (A080577).
%C The Heinz number of an integer partition (y_1,...,y_k) is prime(y_1)*...*prime(y_k). This gives a bijective correspondence between positive integers and integer partitions.
%H Andrew Howroyd, <a href="/A334436/b334436.txt">Table of n, a(n) for n = 0..2713</a> (rows 0..20)
%H Wikiversity, <a href="https://en.wikiversity.org/wiki/Lexicographic_and_colexicographic_order">Lexicographic and colexicographic order</a>
%F A001222(a(n)) = A333486(n).
%e The sequence of terms together with their prime indices begins:
%e 1: {} 32: {1,1,1,1,1} 42: {1,2,4}
%e 2: {1} 13: {6} 54: {1,2,2,2}
%e 3: {2} 25: {3,3} 44: {1,1,5}
%e 4: {1,1} 21: {2,4} 60: {1,1,2,3}
%e 5: {3} 27: {2,2,2} 56: {1,1,1,4}
%e 6: {1,2} 22: {1,5} 72: {1,1,1,2,2}
%e 8: {1,1,1} 30: {1,2,3} 80: {1,1,1,1,3}
%e 7: {4} 28: {1,1,4} 96: {1,1,1,1,1,2}
%e 9: {2,2} 36: {1,1,2,2} 128: {1,1,1,1,1,1,1}
%e 10: {1,3} 40: {1,1,1,3} 19: {8}
%e 12: {1,1,2} 48: {1,1,1,1,2} 49: {4,4}
%e 16: {1,1,1,1} 64: {1,1,1,1,1,1} 55: {3,5}
%e 11: {5} 17: {7} 39: {2,6}
%e 15: {2,3} 35: {3,4} 75: {2,3,3}
%e 14: {1,4} 33: {2,5} 63: {2,2,4}
%e 18: {1,2,2} 45: {2,2,3} 81: {2,2,2,2}
%e 20: {1,1,3} 26: {1,6} 34: {1,7}
%e 24: {1,1,1,2} 50: {1,3,3} 70: {1,3,4}
%e Triangle begins:
%e 1
%e 2
%e 3 4
%e 5 6 8
%e 7 9 10 12 16
%e 11 15 14 18 20 24 32
%e 13 25 21 27 22 30 28 36 40 48 64
%e 17 35 33 45 26 50 42 54 44 60 56 72 80 96 128
%e This corresponds to the following tetrangle:
%e 0
%e (1)
%e (2)(11)
%e (3)(12)(111)
%e (4)(22)(13)(112)(1111)
%e (5)(23)(14)(122)(113)(1112)(11111)
%t lexsort[f_,c_]:=OrderedQ[PadRight[{f,c}]];
%t Table[Times@@Prime/@#&/@Reverse[Sort[Sort/@IntegerPartitions[n],lexsort]],{n,0,8}]
%o (PARI)
%o C(sig)=prod(k=1,#sig,prime(sig[k]))
%o Row(n)=[C(Vec(p)) | p<-vecsort(partitions(n), , 4)]
%o { for(n=0, 7, print(Row(n))) } \\ _Andrew Howroyd_, Oct 06 2025
%Y Row lengths are A000041.
%Y Compositions under the same order are A066099 (triangle).
%Y The version for non-reversed partitions is A129129.
%Y The constructive version is A228531.
%Y The lengths of these partitions are A333486.
%Y The length-sensitive version is A334435.
%Y The dual version (sum/lex) is A334437.
%Y Lexicographically ordered reversed partitions are A026791.
%Y Reversed partitions in Abramowitz-Stegun (sum/length/lex) order are A036036.
%Y Partitions in increasing-length colexicographic order (sum/length/colex) are A036037.
%Y Reverse-lexicographically ordered partitions are A080577.
%Y Sorting reversed partitions by Heinz number gives A112798.
%Y Graded lexicographically ordered partitions are A193073.
%Y Partitions in colexicographic order (sum/colex) are A211992.
%Y Graded Heinz numbers are A215366.
%Y Sorting partitions by Heinz number gives A296150.
%Y Partitions in dual Abramowitz-Stegun (sum/length/revlex) order are A334439.
%Y Cf. A056239, A124734, A185974, A228100, A333219, A334301, A334302, A334433, A334434, A334438.
%K nonn,tabf
%O 0,2
%A _Gus Wiseman_, May 02 2020