A124734 -id:A124734 - cp's OEIS frontend

A334441 Maximum part of the n-th integer partition in Abramowitz-Stegun (sum/length/lex) order; a(0) = 0.

0, 1, 2, 1, 3, 2, 1, 4, 2, 3, 2, 1, 5, 3, 4, 2, 3, 2, 1, 6, 3, 4, 5, 2, 3, 4, 2, 3, 2, 1, 7, 4, 5, 6, 3, 3, 4, 5, 2, 3, 4, 2, 3, 2, 1, 8, 4, 5, 6, 7, 3, 4, 4, 5, 6, 2, 3, 3, 4, 5, 2, 3, 4, 2, 3, 2, 1, 9, 5, 6, 7, 8, 3, 4, 4, 5, 5, 6, 7, 3, 3, 4, 4, 5, 6, 2, 3, 3

Offset: 0

Gus Wiseman, May 06 2020

First differs from A049085 at a(8) = 2, A049085(8) = 3.

The parts of a partition are read in the usual (weakly decreasing) order. The version for reversed (weakly increasing) partitions is A049085.

			Triangle begins:
  0
  1
  2 1
  3 2 1
  4 2 3 2 1
  5 3 4 2 3 2 1
  6 3 4 5 2 3 4 2 3 2 1
  7 4 5 6 3 3 4 5 2 3 4 2 3 2 1
  8 4 5 6 7 3 4 4 5 6 2 3 3 4 5 2 3 4 2 3 2 1

Wikiversity, Lexicographic and colexicographic order

Row lengths are A000041.
The length of the same partition is A036043.
Ignoring partition length (sum/lex) gives A036043 also.
The version for reversed partitions is A049085.
a(n) is the maximum element in row n of A334301.
The number of distinct parts in the same partition is A334440.
Lexicographically ordered reversed partitions are A026791.
Reversed partitions in Abramowitz-Stegun (sum/length/lex) order are A036036.
Partitions in increasing-length colex order (sum/length/colex) are A036037.
Graded reverse-lexicographically ordered partitions are A080577.
Partitions counted by sum and number of distinct parts are A116608.
Graded lexicographically ordered partitions are A193073.
Partitions in colexicographic order (sum/colex) are A211992.
Partitions in dual Abramowitz-Stegun (sum/length/revlex) order are A334439.
Cf. A001221, A103921, A124734, A185974, A296774, A299755, A334302, A334433, A334434, A334435, A334438.

Table[If[n==0,{0},Max/@Sort[IntegerPartitions[n]]],{n,0,10}]

A334440 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.

Original entry on oeis.org

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, 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, 2, 2, 2, 2, 1, 3, 2, 2, 3, 3, 2, 2, 3, 3, 3, 3, 2, 2, 3

Offset: 0

Gus Wiseman, May 05 2020

The total number of parts, counting duplicates, is A036043. The version for reversed partitions is A103921.

			Triangle begins:
  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 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

Robert Price, Table of n, a(n) for n = 0..9295 (25 rows).
Wikiversity, Lexicographic and colexicographic order

Row lengths are A000041.
The number of not necessarily distinct parts is A036043.
The version for reversed partitions is A103921.
Ignoring length (sum/lex) gives A103921 (also).
a(n) is the number of distinct elements in row n of A334301.
The maximum part of the same partition is A334441.
Lexicographically ordered reversed partitions are A026791.
Reversed partitions in Abramowitz-Stegun (sum/length/lex) order are A036036.
Partitions in increasing-length colex order (sum/length/colex) are A036037.
Graded reverse-lexicographically ordered partitions are A080577.
Partitions counted by sum and number of distinct parts are A116608.
Graded lexicographically ordered partitions are A193073.
Partitions in colexicographic order (sum/colex) are A211992.
Partitions in dual Abramowitz-Stegun (sum/length/revlex) order are A334439.
Cf. A001221, A049085, A124734, A185974, A296774, A299755, A334028, A334302, A334433, A334434, A334435, A334438.

Join@@Table[Length/@Union/@Sort[IntegerPartitions[n]],{n,0,10}]

a(n) = A001221(A334433(n)).

A294859 Triangle whose n-th row is the concatenated sequence of all Lyndon compositions of n in lexicographic order.

Original entry on oeis.org

1, 2, 1, 2, 3, 1, 1, 2, 1, 3, 4, 1, 1, 1, 2, 1, 1, 3, 1, 2, 2, 1, 4, 2, 3, 5, 1, 1, 1, 1, 2, 1, 1, 1, 3, 1, 1, 2, 2, 1, 1, 4, 1, 2, 3, 1, 3, 2, 1, 5, 2, 4, 6, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 3, 1, 1, 1, 2, 2, 1, 1, 1, 4, 1, 1, 2, 1, 2, 1, 1, 2, 3, 1, 1, 3, 2, 1

Offset: 1

Gus Wiseman, Dec 18 2017

			Triangle of Lyndon compositions begins:
(1),
(2),
(12),(3),
(112),(13),(4),
(1112),(113),(122),(14),(23),(5),
(11112),(1113),(1122),(114),(123),(132),(15),(24),(6),
(111112),(11113),(11122),(1114),(11212),(1123),(1132),(115),(1213),(1222),(124),(133),(142),(16),(223),(25),(34),(7).

Cf. A000740, A001037, A001045, A008965, A059966, A060223, A066099, A101211, A102659, A124734, A185700, A228369, A281013, A296302, A296373, A296656.

LyndonQ[q_]:=Array[OrderedQ[{q,RotateRight[q,#]}]&,Length[q]-1,1,And]&&Array[RotateRight[q,#]&,Length[q],1,UnsameQ];
Table[Sort[Select[Join@@Permutations/@IntegerPartitions[n],LyndonQ],OrderedQ[PadRight[{#1,#2}]]&],{n,7}]

Row n is a concatenation of A059966(n) Lyndon words with total length A000740(n).

A344086 Flattened tetrangle of strict integer partitions sorted first by sum, then lexicographically.

Original entry on oeis.org

1, 2, 2, 1, 3, 3, 1, 4, 3, 2, 4, 1, 5, 3, 2, 1, 4, 2, 5, 1, 6, 4, 2, 1, 4, 3, 5, 2, 6, 1, 7, 4, 3, 1, 5, 2, 1, 5, 3, 6, 2, 7, 1, 8, 4, 3, 2, 5, 3, 1, 5, 4, 6, 2, 1, 6, 3, 7, 2, 8, 1, 9, 4, 3, 2, 1, 5, 3, 2, 5, 4, 1, 6, 3, 1, 6, 4, 7, 2, 1, 7, 3, 8, 2, 9, 1, 10

Offset: 0

Gus Wiseman, May 11 2021

The zeroth row contains only the empty partition.

A tetrangle is a sequence of finite triangles.

			Tetrangle begins:
  0: ()
  1: (1)
  2: (2)
  3: (21)(3)
  4: (31)(4)
  5: (32)(41)(5)
  6: (321)(42)(51)(6)
  7: (421)(43)(52)(61)(7)
  8: (431)(521)(53)(62)(71)(8)
  9: (432)(531)(54)(621)(63)(72)(81)(9)

Wikiversity, Lexicographic and colexicographic order

Positions of first appearances are A015724.
Triangle sums are A066189.
Taking revlex instead of lex gives A118457.
The not necessarily strict version is A193073.
The version for reversed partitions is A246688.
The Heinz numbers of these partitions grouped by sum are A246867.
The ordered generalization is A339351.
Taking colex instead of lex gives A344087.
A026793 gives reversed strict partitions in A-S order (sum/length/lex).
A319247 sorts reversed strict partitions by Heinz number.
A329631 sorts strict partitions by Heinz number.
A344090 gives strict partitions in A-S order (sum/length/lex).
Cf. A005117, A014466, A209862.
Partition/composition orderings: A026791, A026792, A036036, A036037, A048793, A066099, A080577, A112798, A124734, A162247, A211992, A228100, A228351, A228531, A272020, A299755, A296774, A304038, A334301, A334302, A334439, A334442, A335122, A344085, A344086, A344088, A344089.
Partition/composition applications: A001793, A005183, A036043, A049085, A070939, A115623, A124736, A129129, A185974, A238966, A294648, A333483, A333484, A333485, A333486, A334433, A334434, A334435, A334436, A334437, A334438, A334440, A334441, A335123, A335124, A339195.

lexsort[f_,c_]:=OrderedQ[PadRight[{f,c}]];
Table[Sort[Select[IntegerPartitions[n],UnsameQ@@#&],lexsort],{n,0,8}]

A296772 Triangle read by rows in which row n lists the compositions of n ordered first by decreasing length and then reverse-lexicographically.

Original entry on oeis.org

1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 2, 3, 1, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 2, 3, 1, 2, 2, 1, 3, 4, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 2, 1, 1, 1, 1, 2, 1, 1, 1, 1, 2, 3, 1, 1, 2, 2, 1, 2, 1, 2, 1, 3, 1, 1, 2, 2, 1, 1, 3, 4, 1, 3, 2, 2, 3, 1, 4, 5, 1, 1, 1, 1, 1, 1, 2

Offset: 1

Gus Wiseman, Dec 20 2017

The ordering of compositions in each row is consistent with the reverse-Mathematica ordering of expressions (cf. A124734).

Length of k-th composition is A124748(k-1)+1. - Andrey Zabolotskiy, Dec 20 2017

			Triangle of compositions begins:
(1),
(11),(2),
(111),(21),(12),(3),
(1111),(211),(121),(112),(31),(22),(13),(4),
(11111),(2111),(1211),(1121),(1112),(311),(221),(212),(131),(122),(113),(41),(32),(23),(14),(5).

Cf. A066099, A101211, A108730, A124734, A124748, A228369, A281013, A294859, A296302, A296656, A296773, A296774.

Table[Reverse[Sort[Join@@Permutations/@IntegerPartitions[n]]],{n,6}]

A296773 Triangle read by rows in which row n lists the compositions of n ordered first by decreasing length and then lexicographically.

Original entry on oeis.org

1, 1, 1, 2, 1, 1, 1, 1, 2, 2, 1, 3, 1, 1, 1, 1, 1, 1, 2, 1, 2, 1, 2, 1, 1, 1, 3, 2, 2, 3, 1, 4, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 1, 1, 1, 3, 1, 2, 2, 1, 3, 1, 2, 1, 2, 2, 2, 1, 3, 1, 1, 1, 4, 2, 3, 3, 2, 4, 1, 5, 1, 1, 1, 1, 1, 1, 1

Offset: 1

Gus Wiseman, Dec 20 2017

			Triangle of compositions begins:
(1),
(11),(2),
(111),(12),(21),(3),
(1111),(112),(121),(211),(13),(22),(31),(4),
(11111),(1112),(1121),(1211),(2111),(113),(122),(131),(212),(221),(311),(14),(23),(32),(41),(5).

Cf. A066099, A101211, A108730, A124734, A228369, A281013, A294859, A296302, A296656, A296772, A296774.

Table[Sort[Join@@Permutations/@IntegerPartitions[n],Or[Length[#1]>Length[#2],Length[#1]===Length[#2]&&OrderedQ[{#1,#2}]]&],{n,6}]

A333484 Sort all positive integers, first by sum of prime indices (A056239), then by decreasing number of prime indices (A001222).

Original entry on oeis.org

1, 2, 4, 3, 8, 6, 5, 16, 12, 9, 10, 7, 32, 24, 18, 20, 14, 15, 11, 64, 48, 36, 40, 27, 28, 30, 21, 22, 25, 13, 128, 96, 72, 80, 54, 56, 60, 42, 44, 45, 50, 26, 33, 35, 17, 256, 192, 144, 160, 108, 112, 120, 81, 84, 88, 90, 100, 52, 63, 66, 70, 75, 34, 39, 49, 55, 19

Offset: 0

Gus Wiseman, May 10 2020

A refinement of A215366.

A prime index of n is a number m such that prime(m) divides n. The multiset of prime indices of n is row n of A112798.

			Triangle begins:
    1
    2
    4   3
    8   6   5
   16  12   9  10   7
   32  24  18  20  14  15  11
   64  48  36  40  27  28  30  21  22  25  13
  128  96  72  80  54  56  60  42  44  45  50  26  33  35  17

OEIS Wiki, Orderings of partitions
Wikiversity, Lexicographic and colexicographic order

Row lengths are A000041.
Ignoring length gives A215366 (graded Heinz numbers).
Sorting by increasing length gives A333483.
Number of prime indices is A001222.
Lexicographically ordered reversed partitions are A026791.
Reversed partitions in Abramowitz-Stegun (sum/length/lex) order are A036036.
Partitions in (sum/length/colex) order are A036037.
Sum of prime indices is A056239.
Reverse-lexicographically ordered partitions are A080577.
Sorting reversed partitions by Heinz number gives A112798.
Lexicographically ordered partitions are A193073.
Sorting partitions by Heinz number gives A296150.
Cf. A124734, A129129, A211992, A228100, A333219, A334301, A334433, A334434, A334439, A334441, A334442.

Join@@@Table[Sort[Times@@Prime/@#&/@IntegerPartitions[n,{k}]],{n,0,8},{k,n,0,-1}]

A108244 Triangle read by rows: row n gives list of all compositions of n ordered first by decreasing length, then by reverse colexicographical order.

Original entry on oeis.org

1, 1, 1, 2, 1, 1, 1, 1, 2, 2, 1, 3, 1, 1, 1, 1, 1, 1, 2, 1, 2, 1, 2, 1, 1, 1, 3, 2, 2, 3, 1, 4, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 1, 1, 1, 3, 1, 2, 2, 2, 1, 2, 1, 3, 1, 2, 2, 1, 3, 1, 1, 1, 4, 2, 3, 3, 2, 4, 1, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1

Offset: 1

Hugo van der Sanden, Jun 20 2005

An example of a sequence which contains all finite sequences of positive integers as subsequences.
From Andrey Zabolotskiy, May 18 2018: (Start)
At first, the ordering within the compositions of fixed length coincides with the lexicographical order (which is the case of A228369), but for n = 5 the partitions {2, 1, 2}, {1, 3, 1}, {2, 2, 1} go in this order because the order becomes reverse lexicographical when they are reversed (read right-to-left): {2, 1, 2}, {1, 3, 1}, {1, 2, 2}.
Length of k-th composition is A124748(k-1)+1.
Reversing every composition gives A296772. (End)

			The first 5 rows are:
{1}
{1, 1}, {2}
{1, 1, 1}, {1, 2}, {2, 1}, {3}
{1, 1, 1, 1}, {1, 1, 2}, {1, 2, 1}, {2, 1, 1}, {1, 3}, {2, 2}, {3, 1}, {4}
{1, 1, 1, 1, 1}, {1, 1, 1, 2}, {1, 1, 2, 1}, {1, 2, 1, 1}, {2, 1, 1, 1}, {1, 1, 3}, {1, 2, 2}, {2, 1, 2}, {1, 3, 1}, {2, 2, 1}, {3, 1, 1}, {1, 4}, {2, 3}, {3, 2}, {4, 1}, {5}

Eric Weisstein's World of Mathematics, Combinatorial composition

Cf. A045623, A124748.

Triangles of compositions: A066099 (main entry for compositions; similar to the Mathematica ordering for partitions, A080577), A124734 (similar to the Abramowitz & Stegun ordering for partitions, A036036), and this sequence (similar to the Maple partition ordering, A080576), A296772.

Flatten[ Table[ Reverse[ # ] & /@ Reverse[ Sort[ Flatten[ Permutations[ # ] & /@ Partitions[ n], 1]]], {n, 6}]] (* Robert G. Wilson v, Jun 22 2005 *)

More terms from Robert G. Wilson v, Jun 22 2005

Name corrected by Andrey Zabolotskiy, May 18 2018

A333483 Sort all positive integers, first by sum of prime indices (A056239), then by number of prime indices (A001222).

Original entry on oeis.org

1, 2, 3, 4, 5, 6, 8, 7, 9, 10, 12, 16, 11, 14, 15, 18, 20, 24, 32, 13, 21, 22, 25, 27, 28, 30, 36, 40, 48, 64, 17, 26, 33, 35, 42, 44, 45, 50, 54, 56, 60, 72, 80, 96, 128, 19, 34, 39, 49, 55, 52, 63, 66, 70, 75, 81, 84, 88, 90, 100, 108, 112, 120, 144, 160, 192, 256, 23, 38, 51, 65, 77, 68, 78, 98, 99, 105, 110, 125, 104, 126, 132, 135, 140, 150, 162, 168, 176, 180, 200, 216, 224, 240, 288, 320, 384, 512

Offset: 0

Gus Wiseman, May 10 2020

A refinement of A215366, from which it first differs at a(49) = 55, A215366(49) = 52.

A prime index of n is a number m such that prime(m) divides n. The multiset of prime indices of n is row n of A112798.

			Triangle begins:
   1
   2
   3   4
   5   6   8
   7   9  10  12  16
  11  14  15  18  20  24  32
  13  21  22  25  27  28  30  36  40  48  64
  17  26  33  35  42  44  45  50  54  56  60  72  80  96 128

OEIS Wiki, Orderings of partitions
Wikiversity, Lexicographic and colexicographic order

Row lengths are A000041.
Ignoring length gives A215366 (graded Heinz numbers).
Sorting by decreasing length gives A333484.
Finally sorting lexicographically by prime indices gives A185974.
Finally sorting colexicographically by prime indices gives A334433.
Finally sorting reverse-lexicographically by prime indices gives A334435.
Finally sorting reverse-colexicographically by prime indices gives A334438.
Number of prime indices is A001222.
Reversed partitions in Abramowitz-Stegun (sum/length/lex) order are A036036.
Partitions in (sum/length/colex) order are A036037.
Sum of prime indices is A056239.
Sorting reversed partitions by Heinz number gives A112798.
Sorting partitions by Heinz number gives A296150.
Cf. A026791, A124734, A129129, A193073, A211992, A228100, A333219, A334301, A334434, A334439, A334441, A334442.

Join@@@Table[Sort[Times@@Prime/@#&/@IntegerPartitions[n,{k}]],{n,0,8},{k,0,n}]

A344089 Flattened tetrangle of reversed strict integer partitions, sorted first by length and then colexicographically.

Original entry on oeis.org

1, 2, 3, 1, 2, 4, 1, 3, 5, 2, 3, 1, 4, 6, 2, 4, 1, 5, 1, 2, 3, 7, 3, 4, 2, 5, 1, 6, 1, 2, 4, 8, 3, 5, 2, 6, 1, 7, 1, 3, 4, 1, 2, 5, 9, 4, 5, 3, 6, 2, 7, 1, 8, 2, 3, 4, 1, 3, 5, 1, 2, 6, 10, 4, 6, 3, 7, 2, 8, 1, 9, 2, 3, 5, 1, 4, 5, 1, 3, 6, 1, 2, 7, 1, 2, 3, 4

Offset: 0

Gus Wiseman, May 12 2021

First differs from the revlex (instead of colex) version for partitions of 12.
The zeroth row contains only the empty partition.
A tetrangle is a sequence of finite triangles.

			Tetrangle begins:
  0: ()
  1: (1)
  2: (2)
  3: (3)(12)
  4: (4)(13)
  5: (5)(23)(14)
  6: (6)(24)(15)(123)
  7: (7)(34)(25)(16)(124)
  8: (8)(35)(26)(17)(134)(125)
  9: (9)(45)(36)(27)(18)(234)(135)(126)

Wikiversity, Lexicographic and colexicographic order

Positions of first appearances are A015724 plus one.
Taking lex instead of colex gives A026793 (non-reversed: A118457).
Triangle sums are A066189.
Reversing all partitions gives A344090.
The non-strict version is A344091.
A319247 sorts strict partitions by Heinz number.
A329631 sorts reversed strict partitions by Heinz number.
Cf. A005117, A014466, A209862, A325683, A325859.
Partition/composition orderings: A026791, A026792, A036036, A036037, A048793, A066099, A080577, A112798, A124734, A162247, A193073, A211992, A228100, A228351, A228531, A246688, A272020, A299755, A296774, A304038, A334301, A334302, A334439, A334442, A335122, A339351, A344085, A344086, A344087, A344088, A344089.
Partition/composition applications: A001793, A005183, A036043, A049085, A070939, A115623, A124736, A129129, A185974, A238966, A246867, A294648, A333483, A333484, A333485, A333486, A334433, A334434, A334435, A334436, A334437, A334438, A334440, A334441, A335123, A335124, A339195.

Table[Reverse/@Sort[Select[IntegerPartitions[n],UnsameQ@@#&]],{n,0,30}]

cp's OEIS Frontend

A334441 Maximum part of the n-th integer partition in Abramowitz-Stegun (sum/length/lex) order; a(0) = 0.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

A334440 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.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Formula

A294859 Triangle whose n-th row is the concatenated sequence of all Lyndon compositions of n in lexicographic order.

Views

Author

Keywords

Examples

Crossrefs

Programs

Mathematica

Formula

A344086 Flattened tetrangle of strict integer partitions sorted first by sum, then lexicographically.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

A296772 Triangle read by rows in which row n lists the compositions of n ordered first by decreasing length and then reverse-lexicographically.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A296773 Triangle read by rows in which row n lists the compositions of n ordered first by decreasing length and then lexicographically.

Views

Author

Keywords

Examples

Crossrefs

Programs

Mathematica

A333484 Sort all positive integers, first by sum of prime indices (A056239), then by decreasing number of prime indices (A001222).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

A108244 Triangle read by rows: row n gives list of all compositions of n ordered first by decreasing length, then by reverse colexicographical order.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Extensions

A333483 Sort all positive integers, first by sum of prime indices (A056239), then by number of prime indices (A001222).