login

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”).

A124734
Table with all compositions sorted first by total, then by length and finally lexicographically.
47
1, 2, 1, 1, 3, 1, 2, 2, 1, 1, 1, 1, 4, 1, 3, 2, 2, 3, 1, 1, 1, 2, 1, 2, 1, 2, 1, 1, 1, 1, 1, 1, 5, 1, 4, 2, 3, 3, 2, 4, 1, 1, 1, 3, 1, 2, 2, 1, 3, 1, 2, 1, 2, 2, 2, 1, 3, 1, 1, 1, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 6, 1, 5, 2, 4, 3, 3, 4, 2, 5, 1, 1, 1, 4, 1, 2, 3, 1, 3, 2, 1, 4, 1, 2, 1
OFFSET
1,2
COMMENTS
This is similar to the Abramowitz and Stegun ordering for partitions (see A036036). The standard ordering for compositions is A066099, which is more similar to the Mathematica partition ordering (A080577).
This can be regarded as a table in two ways: with each composition as a row, or with the compositions of each integer as a row. The first way has A124736 as row lengths and A070939 as row sums; the second has A001792 as row lengths and A001788 as row sums.
This sequence includes every finite sequence of positive integers.
LINKS
M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards, Applied Math. Series 55, Tenth Printing, 1972 [alternative scanned copy].
EXAMPLE
The table starts:
1
2; 1 1
3; 1 2; 2 1; 1 1 1
4; 1 3; 2 2; 3 1; 1 1 2; 1 2 1; 2 1 1; 1 1 1 1;
MATHEMATICA
Table[Sort@Flatten[Permutations /@ IntegerPartitions@n, 1], {n, 8}] // Flatten (* Robert Price, Jun 13 2020 *)
KEYWORD
easy,nonn,tabf
AUTHOR
STATUS
approved

  NODES
orte 2
see 2
Story 1