|
%I #26 Sep 22 2023 08:45:50
%S 0,1,1,1,1,2,1,1,1,2,2,1,1,2,2,2,2,2,1,1,1,2,2,1,3,2,2,2,2,1,1,2,2,2,
%T 2,2,3,2,2,3,2,2,2,2,1,1,1,2,2,2,2,2,3,3,2,1,3,2,3,2,2,3,2,2,2,2,1,1,
%U 2,2,2,2,1,3,2,2,3,3,2,2,3,3,3,3,2,2,3
%N Irregular triangle T(n,k) read by rows: row n lists numbers of distinct parts of the n-th integer partition in Abramowitz-Stegun (sum/length/lex) order.
%C The total number of parts, counting duplicates, is A036043. The version for reversed partitions is A103921.
%H Robert Price, <a href="/A334440/b334440.txt">Table of n, a(n) for n = 0..9295</a> (25 rows).
%H Wikiversity, <a href="https://en.wikiversity.org/wiki/Lexicographic_and_colexicographic_order">Lexicographic and colexicographic order</a>
%F a(n) = A001221(A334433(n)).
%e Triangle begins:
%e 0
%e 1
%e 1 1
%e 1 2 1
%e 1 1 2 2 1
%e 1 2 2 2 2 2 1
%e 1 1 2 2 1 3 2 2 2 2 1
%e 1 2 2 2 2 2 3 2 2 3 2 2 2 2 1
%e 1 1 2 2 2 2 2 3 3 2 1 3 2 3 2 2 3 2 2 2 2 1
%t Join@@Table[Length/@Union/@Sort[IntegerPartitions[n]],{n,0,10}]
%Y Row lengths are A000041.
%Y The number of not necessarily distinct parts is A036043.
%Y The version for reversed partitions is A103921.
%Y Ignoring length (sum/lex) gives A103921 (also).
%Y a(n) is the number of distinct elements in row n of A334301.
%Y The maximum part of the same partition is A334441.
%Y Lexicographically ordered reversed partitions are A026791.
%Y Reversed partitions in Abramowitz-Stegun (sum/length/lex) order are A036036.
%Y Partitions in increasing-length colex order (sum/length/colex) are A036037.
%Y Graded reverse-lexicographically ordered partitions are A080577.
%Y Partitions counted by sum and number of distinct parts are A116608.
%Y Graded lexicographically ordered partitions are A193073.
%Y Partitions in colexicographic order (sum/colex) are A211992.
%Y Partitions in dual Abramowitz-Stegun (sum/length/revlex) order are A334439.
%Y Cf. A001221, A049085, A124734, A185974, A296774, A299755, A334028, A334302, A334433, A334434, A334435, A334438.
%K nonn,tabf
%O 0,6
%A _Gus Wiseman_, May 05 2020
|
