|
%I #80 May 16 2020 01:52:13
%S 1,2,1,1,3,1,2,1,1,1,4,1,3,2,2,1,1,2,1,1,1,1,5,1,4,2,3,1,1,3,1,2,2,1,
%T 1,1,2,1,1,1,1,1,6,1,5,2,4,3,3,1,1,4,1,2,3,2,2,2,1,1,1,3,1,1,2,2,1,1,
%U 1,1,2,1,1,1,1,1,1,7,1,6,2,5,3,4,1,1,5,1,2,4,1,3,3,2,2,3,1,1,1
%N Triangle read by rows in which row n lists all the parts of all reversed partitions of n, sorted first by length and then lexicographically.
%C First differs from A334442 for reversed partitions of 9. Namely, this sequence has (1,4,4) before (2,2,5), while A334442 has (2,2,5) before (1,4,4). - _Gus Wiseman_, May 07 2020
%C This is the "Abramowitz and Stegun" ordering of the partitions, referenced in numerous other sequences. The partitions are in reverse order of the conjugates of the partitions in Mathematica order (A080577). Each partition is the conjugate of the corresponding partition in Maple order (A080576). - _Franklin T. Adams-Watters_, Oct 18 2006
%C The "Abramowitz and Stegun" ordering of the partitions is the graded reflected colexicographic ordering of the partitions. - _Daniel Forgues_, Jan 19 2011
%C The "Abramowitz and Stegun" ordering of partitions has been traced back to C. F. Hindenburg, 1779, in the Knuth reference, p. 38. See the Hindenburg link, pp. 77-5 with the listing of the partitions for n=10. This is also mentioned in the P. Luschny link. - _Wolfdieter Lang_, Apr 04 2011
%C The "Abramowitz and Stegun" order used here means that the partitions of a given number are listed by increasing number of (nonzero) parts, then by increasing lexicographical order with parts in (weakly) indecreasing order. This differs from n=9 on from A334442 which considers reverse lexicographic order of parts in (weakly) decreasing order. - _M. F. Hasler_, Jul 12 2015, corrected thanks to _Gus Wiseman_, May 14 2020
%C This is the Abramowitz-Stegun ordering of reversed partitions (finite weakly increasing sequences of positive integers). The same ordering of non-reversed partitions is A334301. - _Gus Wiseman_, May 07 2020
%D Abramowitz and Stegun, Handbook, p. 831, column labeled "pi".
%D D. Knuth, The Art of Computer Programming, Vol. 4, fascicle 3, 7.2.1.4, Addison-Wesley, 2005.
%H Franklin T. Adams-Watters, <a href="/A036036/b036036.txt">First 20 rows, flattened</a>.
%H M. Abramowitz and I. A. Stegun, eds., <a href="http://www.convertit.com/Go/ConvertIt/Reference/AMS55.ASP">Handbook of Mathematical Functions</a>, National Bureau of Standards, Applied Math. Series 55, Tenth Printing, 1972 [alternative scanned copy]. (uses Flash)
%H M. Abramowitz and I. A. Stegun, eds., <a href="http://www.convertit.com/Go/ConvertIt/Reference/AMS55.ASP">Handbook of Mathematical Functions</a>.
%H C. F. Hindenburg, <a href="http://books.google.com/books?id=oIM_AAAAcAAJ">Infinitinomii Dignitatum Exponentis Indeterminati</a>, Goettingen 1779.
%H Peter Luschny, <a href="http://www.luschny.de/math/seq/CountingWithPartitions.html">Counting with partitions</a>.
%H OEIS Wiki, <a href="http://oeis.org/wiki/Orderings of partitions#A comparison">Orderings of partitions (a comparison)</a>.
%H Wikiversity, <a href="https://en.wikiversity.org/wiki/Lexicographic_and_colexicographic_order">Lexicographic and colexicographic order</a>
%e 1
%e 2; 1,1
%e 3; 1,2; 1,1,1
%e 4; 1,3; 2,2; 1,1,2; 1,1,1,1
%e 5; 1,4; 2,3; 1,1,3; 1,2,2; 1,1,1,2; 1,1,1,1,1;
%e 6; 1,5; 2,4; 3,3; 1,1,4; 1,2,3; 2,2,2; 1,1,1,3; 1,1,2,2; 1,1,1,1,2; 1,1,1,1,1,1;
%e ...
%t Join@@Table[Sort[Reverse/@IntegerPartitions[n]],{n,0,8}] (* _Gus Wiseman_, May 07 2020 *)
%t - or -
%t colen[f_,c_]:=OrderedQ[{Reverse[f],Reverse[c]}];
%t Reverse/@Join@@Table[Sort[IntegerPartitions[n],colen],{n,0,8}] (* _Gus Wiseman_, May 07 2020 *)
%o (PARI) T036036(n,k)=k&&return(T036036(n)[k]);concat(partitions(n))
%o \\ If 2nd arg "k" is not given, return the n-th row as a vector. Assumes PARI version >= 2.7.1. See A193073 for "hand made" code.
%o concat(vector(8,n,T036036(n))) \\ to get the "flattened" sequence
%o \\ _M. F. Hasler_, Jul 12 2015
%Y Cf. A036037-A036040.
%Y See A036037 for the graded colexicographic ordering.
%Y See A080576 for the Maple (graded reflected lexicographic) ordering.
%Y See A080577 for the Mathematica (graded reverse lexicographic) ordering.
%Y See A193073 for the graded lexicographic ordering.
%Y See A228100 for the Fenner-Loizou (binary tree) ordering.
%Y The version ignoring length is A026791.
%Y Same as A036037 with partitions reversed.
%Y The lengths of these partitions are A036043.
%Y The number of distinct parts is A103921.
%Y The corresponding ordering of compositions is A124734.
%Y Showing partitions as Heinz numbers gives A185974.
%Y The version for non-reversed partitions is A334301.
%Y Lexicographically ordered reversed partitions are A026791.
%Y Sorting reversed partitions by Heinz number gives A112798.
%Y The version for revlex instead of lex is A334302.
%Y The version for revlex instead of colex is A334442.
%Y Cf. A000041, A211992, A228531, A296774, A334433, A334435, A334436, A334437, A334438, A334439, A334440, A334441.
%K nonn,easy,nice,tabf,look
%O 1,2
%A _N. J. A. Sloane_
%E Edited by _Daniel Forgues_, Jan 21 2011
%E Edited by _M. F. Hasler_, Jul 12 2015
%E Name corrected by _Gus Wiseman_, May 12 2020
|
