A193073 -id:A193073 - cp's OEIS frontend

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

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}]

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}]

A333486 Length of the n-th reversed integer partition in graded reverse-lexicographic order. Partition lengths of A228531.

Original entry on oeis.org

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

Offset: 0

Gus Wiseman, May 23 2020

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

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

Row lengths are A000041.
The generalization to compositions is A000120.
Row sums are A006128.
The same partition has sum A036042.
The length-sensitive version (sum/length/revlex) is A036043.
The colexicographic version (sum/colex) is A049085.
The same partition has minimum A182715.
The lexicographic version (sum/lex) is A193173.
The tetrangle of these partitions is A228531.
The version for non-reversed partitions is A238966.
The same partition has Heinz number A334436.
Reversed partitions in Abramowitz-Stegun order (sum/length/lex) are A036036.
Partitions in lexicographic order (sum/lex) are A193073.
Partitions in colexicographic order (sum/colex) are A211992.
Partitions in opposite Abramowitz-Stegun order (sum/length/revlex) are A334439.
Cf. A026792, A049085, A080576, A080577, A103921, A112798, A115623, A129129, A331581, A334302, A334435, A334442.

revlexsort[f_,c_]:=OrderedQ[PadRight[{c,f}]];
Table[Length/@Sort[Reverse/@IntegerPartitions[n],revlexsort],{n,0,8}]

A194546 Triangle read by rows: T(n,k) is the largest part of the k-th partition of n, with partitions in colexicographic order.

Original entry on oeis.org

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

Offset: 1

Omar E. Pol, Dec 10 2011

Row n lists the first A000041(n) terms of A141285.

The representation of the partitions (for fixed n) is as (weakly) decreasing lists of parts, the order between individual partitions (for the same n) is co-lexicographic, see example. - Joerg Arndt, Sep 13 2013

			For n = 5 the partitions of 5 in colexicographic order are:
  1+1+1+1+1
  2+1+1+1
  3+1+1
  2+2+1
  4+1
  3+2
  5
so the fifth row is the largest in each partition: 1,2,3,2,4,3,5
Triangle begins:
  1;
  1,2;
  1,2,3;
  1,2,3,2,4;
  1,2,3,2,4,3,5;
  1,2,3,2,4,3,5,2,4,3,6;
  1,2,3,2,4,3,5,2,4,3,6,3,5,4,7;
  1,2,3,2,4,3,5,2,4,3,6,3,5,4,7,2,4,3,6,5,4,8;
...

Wikiversity, Lexicographic and colexicographic order

The sum of row n is A006128(n).
Cf. A135010, A138121, A141285, A194547, A194548, A194549.
Row lengths are A000041.
Let y be the n-th integer partition in colexicographic order (A211992):
- The maximum of y is a(n).
- The length of y is A193173(n).
- The minimum of y is A196931(n).
- The Heinz number of y is A334437(n).
Lexicographically ordered reversed partitions are A026791.
Reverse-colexicographically ordered partitions are A026792.
Reversed partitions in Abramowitz-Stegun order (sum/length/lex) are A036036.
Reverse-lexicographically ordered partitions are A080577.
Lexicographically ordered partitions are A193073.
Cf. A036037, A063008, A115623, A228100, A228531, A238966, A334301.

colex[f_,c_]:=OrderedQ[PadRight[{Reverse[f],Reverse[c]}]];
Max/@Join@@Table[Sort[IntegerPartitions[n],colex],{n,8}] (* Gus Wiseman, May 31 2020 *)

a(n) = A061395(A334437(n)). - Gus Wiseman, May 31 2020

Definition corrected by Omar E. Pol, Sep 12 2013

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}]

A333485 Heinz numbers of all integer partitions sorted first by sum, then by decreasing length, and finally lexicographically. A code for the Fenner-Loizou tree A228100.

Original entry on oeis.org

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

Offset: 0

Gus Wiseman, May 11 2020

A permutation of the positive integers.
The Heinz number of an integer partition (y_1,...,y_k) is prime(y_1)*...*prime(y_k), which gives a bijective correspondence between positive integers and integer partitions.
As a triangle with row lengths A000041, the sequence starts {{1},{2},{4,3},{8,6,5},...}, so offset is 0.

			The sequence of terms together with their prime indices begins:
    1: {}              11: {5}                 56: {1,1,1,4}
    2: {1}             64: {1,1,1,1,1,1}       45: {2,2,3}
    4: {1,1}           48: {1,1,1,1,2}         50: {1,3,3}
    3: {2}             36: {1,1,2,2}           42: {1,2,4}
    8: {1,1,1}         40: {1,1,1,3}           44: {1,1,5}
    6: {1,2}           27: {2,2,2}             35: {3,4}
    5: {3}             30: {1,2,3}             33: {2,5}
   16: {1,1,1,1}       28: {1,1,4}             26: {1,6}
   12: {1,1,2}         25: {3,3}               17: {7}
    9: {2,2}           21: {2,4}              256: {1,1,1,1,1,1,1,1}
   10: {1,3}           22: {1,5}              192: {1,1,1,1,1,1,2}
    7: {4}             13: {6}                144: {1,1,1,1,2,2}
   32: {1,1,1,1,1}    128: {1,1,1,1,1,1,1}    160: {1,1,1,1,1,3}
   24: {1,1,1,2}       96: {1,1,1,1,1,2}      108: {1,1,2,2,2}
   18: {1,2,2}         72: {1,1,1,2,2}        120: {1,1,1,2,3}
   20: {1,1,3}         80: {1,1,1,1,3}        112: {1,1,1,1,4}
   15: {2,3}           54: {1,2,2,2}           81: {2,2,2,2}
   14: {1,4}           60: {1,1,2,3}           90: {1,2,2,3}
The triangle begins:
    1
    2
    4   3
    8   6   5
   16  12   9  10   7
   32  24  18  20  15  14  11
   64  48  36  40  27  30  28  25  21  22  13
  128  96  72  80  54  60  56  45  50  42  44  35  33  26  17

Michael De Vlieger, Table of n, a(n) for n = 0..9295 (rows 0 <= n <= 25, flattened)
Michael De Vlieger, log-log plot of rows 0 <= n <= 30 of this sequence, highlighting 2^n in red and prime(n) in blue.
T. I. Fenner, G. Loizou: A binary tree representation and related algorithms for generating integer partitions. The Computer J. 23(4), 332-337 (1980)
OEIS Wiki, Orderings of partitions
Wikiversity, Lexicographic and colexicographic order

Row lengths are A000041.
The constructive version is A228100.
Sorting by increasing length gives A334433.
The version with rows reversed is A334438.
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.
Graded Heinz numbers are A215366.
Sorting partitions by Heinz number gives A296150.
If the fine ordering is by Heinz number instead of lexicographic we get A333484.
Cf. A000041, A026791, A036036, A036037, A036043, A185974, A211992, A228351, A296773, A333483, A334301, A334439.

ralensort[f_,c_]:=If[Length[f]!=Length[c],Length[f]>Length[c],OrderedQ[{f,c}]];
Join@@Table[Times@@Prime/@#&/@Sort[IntegerPartitions[n],ralensort],{n,0,8}]

A001221(a(n)) = A115623(n).
A001222(a(n - 1)) = A331581(n).
A061395(a(n > 1)) = A128628(n).

Name extended by Peter Luschny, Dec 23 2020

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}]

A335122 Irregular triangle whose reversed rows are all integer partitions in graded reverse-lexicographic order.

Original entry on oeis.org

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

Offset: 0

Gus Wiseman, May 24 2020

First differs from A036036 for partitions of 6.
First differs from A334442 for partitions of 6.
Also reversed partitions in reverse-colexicographic order.

			The sequence of all reversed partitions begins:
  ()         (1,1,3)        (7)              (8)
  (1)        (1,2,2)        (1,6)            (1,7)
  (2)        (1,1,1,2)      (2,5)            (2,6)
  (1,1)      (1,1,1,1,1)    (1,1,5)          (1,1,6)
  (3)        (6)            (3,4)            (3,5)
  (1,2)      (1,5)          (1,2,4)          (1,2,5)
  (1,1,1)    (2,4)          (1,1,1,4)        (1,1,1,5)
  (4)        (1,1,4)        (1,3,3)          (4,4)
  (1,3)      (3,3)          (2,2,3)          (1,3,4)
  (2,2)      (1,2,3)        (1,1,2,3)        (2,2,4)
  (1,1,2)    (1,1,1,3)      (1,1,1,1,3)      (1,1,2,4)
  (1,1,1,1)  (2,2,2)        (1,2,2,2)        (1,1,1,1,4)
  (5)        (1,1,2,2)      (1,1,1,2,2)      (2,3,3)
  (1,4)      (1,1,1,1,2)    (1,1,1,1,1,2)    (1,1,3,3)
  (2,3)      (1,1,1,1,1,1)  (1,1,1,1,1,1,1)  (1,2,2,3)
We have the following tetrangle of reversed partitions:
                             0
                            (1)
                          (2)(11)
                        (3)(12)(111)
                   (4)(13)(22)(112)(1111)
             (5)(14)(23)(113)(122)(1112)(11111)
  (6)(15)(24)(114)(33)(123)(1113)(222)(1122)(11112)(111111)

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

Row lengths are A000041.
The version for reversed partitions is A026792.
The version for colex instead of revlex is A026791.
The version for lex instead of revlex is A080576.
The non-reflected version is A080577.
The number of distinct parts is A115623.
Taking Heinz numbers gives A129129.
The version for compositions is A228351.
Partition lengths are A238966.
Partition maxima are A331581.
The length-sensitive version is A334442.
Lexicographically ordered partitions are A193073.
Partitions in colexicographic order are A211992.
Cf. A036036, A036037, A112798, A129129, A228531, A296774, A334301, A334302, A334435, A334436, A334438, A334439.

revlexsort[f_,c_]:=OrderedQ[PadRight[{c,f}]];
Reverse/@Join@@Table[Sort[IntegerPartitions[n],revlexsort],{n,0,8}]

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

Original entry on oeis.org

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

Offset: 0

Gus Wiseman, May 24 2020

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

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

Row lengths are A000041.
Partition minima of A334301.
The length of the same partition is A036043.
The Heinz number of the same partition is A334433.
The number of distinct parts in the same partition is A334440.
The maximum of the same partition is A334441.
The version for reversed partitions is A335124.
Reversed partitions in Abramowitz-Stegun (sum/length/lex) order are A036036.
Partitions in (sum/length/revlex) order are A334439.
Cf. A026791, A049085, A103921, A124734, A185974, A193073, A334302, A334433.

Table[If[n==0,{0},Min/@Sort[IntegerPartitions[n]]],{n,0,8}]

a(n) = A055396(A334433(n)).

A335124 Minimum part of the n-th reversed integer partition in Abramowitz-Stegun order; a(0) = 0.

Original entry on oeis.org

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

Offset: 0

Gus Wiseman, May 24 2020

The ordering of reversed partitions is first by sum, then by length, and finally lexicographically. The version for non-reversed partitions is A335123.

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

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

Row lengths are A000041.
Partition minima of A036036.
The length of the same partition is A036043.
The maximum of the same partition is A049085.
The number of distinct parts in the same partition is A103921.
The Heinz number of the same partition is A185974.
The version for non-reversed partitions is A335123.
Lexicographically ordered reversed partitions are A026791.
Partitions in (sum/length/colex) order are A036037.
Partitions in opposite Abramowitz-Stegun (sum/length/revlex) order are A334439.
Cf. A124734, A193073, A334301, A334302, A334433, A334435.

Table[If[n==0,{0},Min/@Sort[Reverse/@IntegerPartitions[n]]],{n,0,8}]

a(n) = A055396(A185974(n)).

cp's OEIS Frontend

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

Views

Author

Keywords

Comments

Examples

Links

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

A333486 Length of the n-th reversed integer partition in graded reverse-lexicographic order. Partition lengths of A228531.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Mathematica

A194546 Triangle read by rows: T(n,k) is the largest part of the k-th partition of n, with partitions in colexicographic order.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Formula

Extensions

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

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

A333485 Heinz numbers of all integer partitions sorted first by sum, then by decreasing length, and finally lexicographically. A code for the Fenner-Loizou tree A228100.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Formula

Extensions

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

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

A335122 Irregular triangle whose reversed rows are all integer partitions in graded reverse-lexicographic order.

Views

Author

Keywords

Comments

Examples