Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #55 Sep 22 2023 07:55:56
%S 1,2,3,4,5,6,8,7,10,9,12,16,11,14,15,20,18,24,32,13,22,21,28,25,30,40,
%T 27,36,48,64,17,26,33,44,35,42,56,50,45,60,80,54,72,96,128,19,34,39,
%U 52,55,66,88,49,70,63,84,112,75,100,90,120,160,81,108,144,192,256
%N An irregular triangular array of natural numbers read by rows, with shape sequence A000041(n) related to sequence A060850.
%C The tree begins (at height n, n >= 0, nodes represent partitions of n)
%C 0: 1
%C 1: 2
%C 2: 3 4
%C 3: 5 6 8
%C 4: 7 10 9 12 16
%C 5: 11 14 15 20 18 24 32
%C ...
%C and hence differs from A114622.
%C Ordering [graded reverse lexicographic order] of partitions (positive integer representation) of nonnegative integers, where part of size i [as summand] is mapped to i-th prime [as multiplicand], where the empty partition for 0 yields the empty product, i.e., 1. Permutation of positive integers, since bijection [1-1 and onto map] between the set of all partitions of nonnegative integers and positive integers. - _Daniel Forgues_, Aug 07 2018
%C These are all Heinz numbers of integer partitions in graded reverse-lexicographic order, where The Heinz number of a partition (y_1,...,y_k) is prime(y_1)*...*prime(y_k). This is the so-called "Mathematica" order (sum/revlex) of partitions (A080577). Partitions in lexicographic order (sum/lex) are A193073, with Heinz numbers A334434. - _Gus Wiseman_, May 19 2020
%H Michael De Vlieger, <a href="/A129129/b129129.txt">Table of n, a(n) for n = 0..11731</a> (rows 0 <= n <= 26).
%H OEIS Wiki, <a href="/wiki/Partitions#Orderings_of_partitions">Partitions#Orderings of partitions</a>.
%H Wikiversity, <a href="https://en.wikiversity.org/wiki/Lexicographic_and_colexicographic_order">Lexicographic and colexicographic order</a>.
%F From _Gus Wiseman_, May 19 2020: (Start)
%F A001222(a(n)) = A238966(n).
%F A001221(a(n)) = A115623(n).
%F A056239(a(n)) = A036042(n).
%F A061395(a(n)) = A331581(n).
%F (End)
%e The array is a tree structure as described by A128628. If a node value has only one branch the value is twice that of its parent node. If it has two branches one is twice that of its parent node but the other is defined as indicated below:
%e (1) pick an odd number (e.g., 135)
%e (2) calculate its prime factorization (135 = 5*3*3*3)
%e (3) note the least prime factor (LPF(135) = 3)
%e (4) note the index of the LPF (index(3) = 2)
%e (5) subtract one from the index (2-1 = 1)
%e (6) calculate the prime associated with the value in step five (prime(1) = 2)
%e (7) The parent node of the odd number 135 is (2/3)*135 = 90 = A252461(135).
%e From _Daniel Forgues_, Aug 07 2018: (Start)
%e Partitions of 4 in graded reverse lexicographic order:
%e {4}: p_4 = 7;
%e {3,1}: p_3 * p_1 = 5 * 2 = 10;
%e {2,2}: p_2 * p_2 = 3^2 = 9;
%e {2,1,1}: p_2 * p_1 * p_1 = 3 * 2^2 = 12;
%e {1,1,1,1}: p_1 * p_1 * p_1 * p_1 = 2^4 = 16. (End)
%e From _Gus Wiseman_, May 19 2020: (Start)
%e The sequence together with the corresponding partitions begins:
%e 1: () 24: (2,1,1,1) 35: (4,3)
%e 2: (1) 32: (1,1,1,1,1) 42: (4,2,1)
%e 3: (2) 13: (6) 56: (4,1,1,1)
%e 4: (1,1) 22: (5,1) 50: (3,3,1)
%e 5: (3) 21: (4,2) 45: (3,2,2)
%e 6: (2,1) 28: (4,1,1) 60: (3,2,1,1)
%e 8: (1,1,1) 25: (3,3) 80: (3,1,1,1,1)
%e 7: (4) 30: (3,2,1) 54: (2,2,2,1)
%e 10: (3,1) 40: (3,1,1,1) 72: (2,2,1,1,1)
%e 9: (2,2) 27: (2,2,2) 96: (2,1,1,1,1,1)
%e 12: (2,1,1) 36: (2,2,1,1) 128: (1,1,1,1,1,1,1)
%e 16: (1,1,1,1) 48: (2,1,1,1,1) 19: (8)
%e 11: (5) 64: (1,1,1,1,1,1) 34: (7,1)
%e 14: (4,1) 17: (7) 39: (6,2)
%e 15: (3,2) 26: (6,1) 52: (6,1,1)
%e 20: (3,1,1) 33: (5,2) 55: (5,3)
%e 18: (2,2,1) 44: (5,1,1) 66: (5,2,1)
%e (End)
%p b:= (n, i)-> `if`(n=0 or i=1, [2^n], [map(x-> x*ithprime(i),
%p b(n-i, min(n-i, i)))[], b(n, i-1)[]]):
%p T:= n-> b(n$2)[]:
%p seq(T(n), n=0..10); # _Alois P. Heinz_, Feb 14 2020
%t Array[Times @@ # & /@ Prime@ IntegerPartitions@ # &, 9, 0] // Flatten (* _Michael De Vlieger_, Aug 07 2018 *)
%t b[n_, i_] := b[n, i] = If[n == 0 || i == 1, {2^n}, Join[(# Prime[i]&) /@ b[n - i, Min[n - i, i]], b[n, i - 1]]];
%t T[n_] := b[n, n];
%t T /@ Range[0, 10] // Flatten (* _Jean-François Alcover_, May 21 2021, after _Alois P. Heinz_ *)
%Y Cf. A080577 (the partitions), A252461, A114622, A128628, A215366 (sorted rows).
%Y Row lengths are A000041.
%Y Compositions under the same order are A066099.
%Y The opposite version (sum/lex) is A334434.
%Y The length-sensitive version (sum/length/revlex) is A334438.
%Y The version for reversed (weakly increasing) partitions is A334436.
%Y Lexicographically ordered reversed partitions are A026791.
%Y Reversed partitions in Abramowitz-Stegun order (sum/length/lex) are A036036.
%Y Sum of prime indices is A056239.
%Y Sorting reversed partitions by Heinz number gives A112798.
%Y Partitions in lexicographic order are A193073.
%Y Sorting partitions by Heinz number gives A296150.
%Y Cf. A036037, A185974, A211992, A334301, A334433, A334435, A334437, A334439.
%K nonn,tabf
%O 0,2
%A _Alford Arnold_, Mar 31 2007