A194446 -id:A194446 - cp's OEIS frontend

A211992 Triangle read by rows in which row n lists the partitions of n in colexicographic order.

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

Offset: 1

Omar E. Pol, Aug 18 2012

The order of the partitions of every integer is reversed with respect to A026792. For example: in A026792 the partitions of 3 are listed as [3], [2, 1], [1, 1, 1], however here the partitions of 3 are listed as [1, 1, 1], [2, 1], [3].
Row n has length A006128(n). Row sums give A066186. Right border gives A000027. The equivalent sequence for compositions (ordered partitions) is A228525. - Omar E. Pol, Aug 24 2013
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. The equivalent sequence for partitions as (weakly) increasing lists and lexicographic order is A026791. - Joerg Arndt, Sep 02 2013

			From _Omar E. Pol_, Aug 24 2013: (Start)
Illustration of initial terms:
-----------------------------------------
n      Diagram          Partition
-----------------------------------------
.       _
1      |_|              1;
.       _ _
2      |_| |            1, 1,
2      |_ _|            2;
.       _ _ _
3      |_| | |          1, 1, 1,
3      |_ _| |          2, 1,
3      |_ _ _|          3;
.       _ _ _ _
4      |_| | | |        1, 1, 1, 1,
4      |_ _| | |        2, 1, 1,
4      |_ _ _| |        3, 1,
4      |_ _|   |        2, 2,
4      |_ _ _ _|        4;
.       _ _ _ _ _
5      |_| | | | |      1, 1, 1, 1, 1,
5      |_ _| | | |      2, 1, 1, 1,
5      |_ _ _| | |      3, 1, 1,
5      |_ _|   | |      2, 2, 1,
5      |_ _ _ _| |      4, 1,
5      |_ _ _|   |      3, 2,
5      |_ _ _ _ _|      5;
.       _ _ _ _ _ _
6      |_| | | | | |    1, 1, 1, 1, 1, 1,
6      |_ _| | | | |    2, 1, 1, 1, 1,
6      |_ _ _| | | |    3, 1, 1, 1,
6      |_ _|   | | |    2, 2, 1, 1,
6      |_ _ _ _| | |    4, 1, 1,
6      |_ _ _|   | |    3, 2, 1,
6      |_ _ _ _ _| |    5, 1,
6      |_ _|   |   |    2, 2, 2,
6      |_ _ _ _|   |    4, 2,
6      |_ _ _|     |    3, 3,
6      |_ _ _ _ _ _|    6;
...
Triangle begins:
[1];
[1,1], [2];
[1,1,1], [2,1], [3];
[1,1,1,1], [2,1,1], [3,1], [2,2], [4];
[1,1,1,1,1], [2,1,1,1], [3,1,1], [2,2,1], [4,1], [3,2], [5];
[1,1,1,1,1,1], [2,1,1,1,1], [3,1,1,1], [2,2,1,1], [4,1,1], [3,2,1], [5,1], [2,2,2], [4,2], [3,3], [6];
(End)
From _Gus Wiseman_, May 10 2020: (Start)
The triangle with partitions shown as Heinz numbers (A334437) begins:
    1
    2
    4   3
    8   6   5
   16  12  10   9   7
   32  24  20  18  14  15  11
   64  48  40  36  28  30  22  27  21  25  13
  128  96  80  72  56  60  44  54  42  50  26  45  33  35  17
(End)

Joerg Arndt, Table of n, a(n) for n = 1..10000
OEIS Wiki, Orderings of partitions
Wikiversity, Lexicographic and colexicographic order

Cf. A026791, A141285, A194446, A228531.
The graded reversed version is A026792.
The length-sensitive refinement is A036037.
The version for reversed partitions is A080576.
Partition lengths are A193173.
Partition maxima are A194546.
Partition minima are A196931.
The version for compositions is A228525.
The Heinz numbers of these partitions are A334437.
Cf. A036036, A080577, A193073, A228100, A296150, A331581, A334301, A334302, A334436, A334439, A334442.

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

gen_part(n)=
{  /* Generate partitions of n as weakly increasing lists (order is lex): */
    my(ct = 0);
    my(m, pt);
    my(x, y);
    \\ init:
    my( a = vector( n + (n<=1) ) );
    a[1] = 0;  a[2] = n;  m = 2;
    while ( m!=1,
        y = a[m] - 1;
        m -= 1;
        x = a[m] + 1;
        while ( x<=y,
            a[m] = x;
            y = y - x;
            m += 1;
        );
        a[m] = x + y;
        pt = vector(m, j, a[j]);
    /* for A026791 print partition: */
\\        for (j=1, m, print1(pt[j],", ") );
    /* for A211992 print partition as weakly decreasing list (order is colex): */
        forstep (j=m, 1, -1, print1(pt[j],", ") );
        ct += 1;
    );
    return(ct);
}
for(n=1, 10, gen_part(n) );
\\ Joerg Arndt, Sep 02 2013

A225620 Indices of partitions in the table of compositions of A228351.

Original entry on oeis.org

1, 2, 3, 4, 6, 7, 8, 10, 12, 14, 15, 16, 20, 24, 26, 28, 30, 31, 32, 36, 40, 42, 48, 52, 56, 58, 60, 62, 63, 64, 72, 80, 84, 96, 100, 104, 106, 112, 116, 120, 122, 124, 126, 127, 128, 136, 144, 160, 164, 168, 170, 192, 200, 208, 212, 224, 228, 232, 234, 240, 244, 248, 250, 252, 254, 255

Offset: 1

Omar E. Pol, Aug 03 2013

Also triangle read by rows in which T(n,k) is the decimal representation of a binary number whose mirror represents the k-th partition of n according with the list of juxtaposed reverse-lexicographically ordered partitions of the positive integers (A026792).
In order to construct this sequence as a triangle we use the following rules:
- In the list of A026792 we replace each part of size j of the k-th partition of n by concatenation of j - 1 zeros and only one 1.
- Then replace this new set of parts by the concatenation of its parts.
- Then replace this string by its mirror version which is a binary number.
T(n,k) is the decimal value of this binary number, which represents the k-th partition of n (see example).
The partitions of n are represented by a subsequence with A000041(n) integers starting with 2^(n-1) and ending with 2^n - 1, n >= 1. The odd numbers of the sequence are in A000225.
First differs from A065609 at a(23).
Conjecture: this sequence is a sorted version of b(n) where b(2^k) = 2^k for k >= 0, b(n) = A080100(n)*(2*b(A053645(n)) + 1) otherwise. - Mikhail Kurkov, Oct 21 2023

			T(6,8) = 58 because 58 in base 2 is 111010 whose mirror is 010111 which is the concatenation of 01, 01, 1, 1, whose number of digits are 2, 2, 1, 1, which are also the 8th partition of 6.
Illustration of initial terms:
The sequence represents a table of partitions (see below):
--------------------------------------------------------
.            Binary                        Partitions
n  k  T(n,k) number  Mirror   Diagram       (A026792)
.                                          1 2 3 4 5 6
--------------------------------------------------------
.                             _
1  1     1       1    1        |           1,
.                             _ _
1  1     2      10    01      _  |           2,
2  2     3      11    11       | |         1,1,
.                             _ _ _
3  1     4     100    001     _ _  |           3,
3  2     6     110    011     _  | |         2,1,
3  3     7     111    111      | | |       1,1,1,
.                             _ _ _ _
4  1     8    1000    0001    _ _    |           4,
4  2    10    1010    0101    _ _|_  |         2,2,
4  3    12    1100    0011    _ _  | |         3,1,
4  4    14    1110    0111    _  | | |       2,1,1,
4  5    15    1111    1111     | | | |     1,1,1,1,
.                             _ _ _ _ _
5  1    16   10000    00001   _ _ _    |           5,
5  2    20   10100    00101   _ _ _|_  |         3,2,
5  3    24   11000    00011   _ _    | |         4,1,
5  4    26   11010    01011   _ _|_  | |       2,2,1,
5  5    28   11100    00111   _ _  | | |       3,1,1,
5  6    30   11110    01111   _  | | | |     2,1,1,1,
5  7    31   11111    11111    | | | | |   1,1,1,1,1,
.                             _ _ _ _ _ _
6  1    32  100000    000001  _ _ _      |           6
6  2    36  100100    001001  _ _ _|_    |         3,3,
6  3    40  101000    000101  _ _    |   |         4,2,
6  4    42  101010    010101  _ _|_ _|_  |       2,2,2,
6  5    48  110000    000011  _ _ _    | |         5,1,
6  6    52  110100    001011  _ _ _|_  | |       3,2,1,
6  7    56  111000    000111  _ _    | | |       4,1,1,
6  8    58  111010    010111  _ _|_  | | |     2,2,1,1,
6  9    60  111100    001111  _ _  | | | |     3,1,1,1,
6  10   62  111110    011111  _  | | | | |   2,1,1,1,1,
6  11   63  111111    111111   | | | | | | 1,1,1,1,1,1,
.
Triangle begins:
  1;
  2,   3;
  4,   6,  7;
  8,  10, 12, 14, 15;
  16, 20, 24, 26, 28, 30, 31;
  32, 36, 40, 42, 48, 52, 56, 58, 60, 62, 63;
  ...
From _Gus Wiseman_, Apr 01 2020: (Start)
Using the encoding of A066099, this sequence ranks all finite nonempty multisets, as follows.
   1: {1}
   2: {2}
   3: {1,1}
   4: {3}
   6: {1,2}
   7: {1,1,1}
   8: {4}
  10: {2,2}
  12: {1,3}
  14: {1,1,2}
  15: {1,1,1,1}
  16: {5}
  20: {2,3}
  24: {1,4}
  26: {1,2,2}
  28: {1,1,3}
  30: {1,1,1,2}
  31: {1,1,1,1,1}
(End)

Column 1 is A000079. Row n has length A000041(n). Right border gives A000225.
Cf. A026792, A065609, A135010, A141285, A186114, A194446, A194546, A206437, A207779, A211978, A225600, A225610, A228351.
The case covering an initial interval is A333379 or A333380.
All of the following pertain to compositions in the order of A066099.
- The weakly increasing version is this sequence.
- The weakly decreasing version is A114994.
- The strictly increasing version is A333255.
- The strictly decreasing version is A333256.
- The unequal version is A233564.
- The equal version is A272919.
- The case covering an initial interval is A333217.
- Initial intervals are ranked by A164894.
- Reversed initial intervals are ranked by A246534.
Cf. A000120, A029931, A048793, A070939, A124766, A233249, A333219, A333220.

stc[n_]:=Differences[Prepend[Join@@Position[Reverse[IntegerDigits[n,2]],1],0]]//Reverse;
Select[Range[0,100],LessEqual@@stc[#]&] (* Gus Wiseman, Apr 01 2020 *)

Conjecture: a(A000070(m) - k) = 2^m - A228354(k) for m > 0, 0 < k <= A000041(m). - Mikhail Kurkov, Oct 20 2023

A186114 Triangle of regions and partitions of integers (see Comments lines for definition).

Original entry on oeis.org

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

Offset: 1

Omar E. Pol, Aug 08 2011

Let r = T(n,k) be a record in the sequence. The consecutive records "r" are the natural numbers A000027. Consider the first n rows; the triangle T(n,k) has the property that the columns, without the zeros, from k..1, are also the partitions of r in juxtaposed reverse-lexicographical order, so k is also A000041(r), the number of partitions of r. Note that a record r is always the final term of a row if such row contains 1’s. The number of positive integer a(1)..r is A006128(r). The sums a(1)..r is A066186(r). Here the set of positive integers in every row (from 1 to n) is called a “region” of r. The number of regions of r equals the number of partitions of r. If T(n,1) = 1 then the row n is formed by the smallest parts, in nondecreasing order, of all partitions of T(n,n).

			Triangle begins:
1,
1, 2,
1, 1, 3,
0, 0, 0, 2,
1, 1, 1, 2, 4,
0, 0, 0, 0, 0, 3,
1, 1, 1, 1, 1, 2, 5,
0, 0, 0, 0, 0, 0, 0, 2,
0, 0, 0, 0, 0, 0, 0, 2, 4,
0, 0, 0, 0, 0, 0, 0, 0, 0, 3,
1, 1, 1, 1, 1, 1, 1, 2, 2, 3, 6
...
The row n = 11 contains the 6th record in the sequence:  a(66) = T(11,11) = 6, then consider the first 11 rows of triangle. Note that the columns, from k = 11..1, without the zeros, are also the 11 partitions of 6 in juxtaposed reverse-lexicographical order: [6], [3, 3], [4, 2], [2, 2, 2], [5, 1], [3, 2, 1], [4, 1, 1], [2, 2, 1, 1], [3, 1, 1, 1], [2, 1, 1, 1, 1], [1, 1, 1, 1, 1, 1]. See A026792.

Robert Price, Table of n, a(n) for n = 1..196878, rows 1-627.
Omar E. Pol, Illustration of the seven regions of 5

Mirror of triangle A193870. Column 1 gives A167392. Right diagonal gives A141285.

Cf. A000041, A135010, A138121, A183152, A186412, A187219, A194436-A194439, A194446-A194448, A206437.

A206437 = Cases[Import["https://oeis.org/A206437/b206437.txt",
     "Table"], {, }][[All, 2]];
A194446 = Cases[Import["https://oeis.org/A194446/b194446.txt",
    "Table"], {, }][[All, 2]];
f[n_] := Module[{v},
   v = Take[A206437, A194446[[n]]];
   A206437 = Drop[A206437, A194446[[n]]];
   Reverse[PadRight[v, n]]];
Table[f[n], {n, PartitionsP[20]}]  // Flatten (* Robert Price, Apr 26 2020 *)

T(n,1) = A167392(n).

T(n,k) = A141285(n), if k = n.

A193870 Triangle of regions and partitions of integers (see Comments lines for definition).

Original entry on oeis.org

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

Offset: 1

Omar E. Pol, Aug 07 2011

Triangle T(n,k) read by rows in which, from rows 1..n, if r = T(n,k) is a record in the sequence then the set of positive integers in every row (from 1 to n) is called a “region” of r. Note that n, the number of regions of r is also the number of partitions of r. The consecutive records "r" are the natural numbers A000027. The triangle has the property that, for rows n..1, the diagonals (without the zeros) are also the partitions of r, in juxtaposed reverse-lexicographical order. Note that a record "r" is the initial term of a row if such row contains 1’s. If T(n,k) is a record in the sequence then A000041(T(n,k)) = n. Note that if T(n,k) < 2 is not the last term of the row n then T(n,k+1) = T(n,k). The union of the rows that contain 1's gives A182715.

			Triangle begins:
1,
2, 1,
3, 1, 1,
2, 0, 0, 0,
4, 2, 1, 1, 1,
3, 0, 0, 0, 0, 0,
5, 2, 1, 1, 1, 1, 1,
2, 0, 0, 0, 0, 0, 0, 0,
4, 2, 0, 0, 0, 0, 0, 0, 0,
3, 0, 0, 0, 0, 0, 0, 0, 0, 0,
6, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1,
…
For n = 11 note that the row n contains the 6th record in the sequence: T(11,1) = a(56) = 6, then consider the first 11 rows of triangle. Note that the diagonals d, from d = n..1, without the zeros, are also the partitions of 6 in juxtaposed reverse-lexicographical order: [6], [3, 3], [4, 2], [2, 2, 2], [5, 1], [3, 2, 1], [4, 1, 1], [2, 2, 1, 1], [3, 1, 1, 1], [2, 1, 1, 1, 1], [1, 1, 1, 1, 1, 1]. See A026792.

Robert Price, Table of n, a(n) for n = 1..196878, rows 1-627.
Omar E. Pol, Illustration of the seven regions of 5

Mirror of triangle A186114. Column 1 gives A141285. Right diagonal gives A167392.

Cf. A046746, A135010, A138121, A182699, A182709, A183152, A186412, A187219, A194436-A194439, A194446-A194448, A206437.

A206437 = Cases[Import["https://oeis.org/A206437/b206437.txt",
     "Table"], {, }][[All, 2]];
A194446 = Cases[Import["https://oeis.org/A194446/b194446.txt",
     "Table"], {, }][[All, 2]];f[n_] := Module[{v},
   v = Take[A206437, A194446[[n]]];
   A206437 = Drop[A206437, A194446[[n]]];
   PadRight[v, n]];
Table[f[n], {n, PartitionsP[20]}] // Flatten (* Robert Price, Apr 26 2020 *)

T(n,1) = A141285(n).

T(n,k) = A167392(n), if k = n.

A194447 Rank of the n-th region of the set of partitions of j, if 1<=n<=A000041(j).

Original entry on oeis.org

0, 0, 0, 1, -1, 2, -2, 1, 2, 2, -5, 2, 3, 3, -8, 1, 2, 2, 2, 4, 3, -14, 2, 3, 3, 3, 2, 4, 4, -21, 1, 2, 2, 2, 4, 3, 1, 3, 5, 5, 4, -32, 2, 3, 3, 3, 2, 4, 4, 1, 4, 3, 5, 6, 5, -45, 1, 2, 2, 2, 4, 3, 1, 3, 5, 5, 4, -2, 2, 4, 4, 5, 3, 6, 6, 5, -65

Offset: 1

Omar E. Pol, Dec 04 2011

Here the rank of a "region" is defined to be the largest part minus the number of parts (the same idea as the Dyson's rank of a partition).
Also triangle read by rows: T(j,k) = rank of the k-th region of the last section of the set of partitions of j.
The sum of every row is equal to zero.
Note that in some rows there are several negative terms. - Omar E. Pol, Oct 27 2012
For the definition of "region" see A206437. See also A225600 and A225610. - Omar E. Pol, Aug 12 2013

			In the triangle T(j,k) for j = 6 the number of regions in the last section of the set of partitions of 6 is equal to 4. The first region given by [2] has rank 2-1 = 1. The second region given by [4,2] has rank 4-2 = 2. The third region given by [3] has rank 3-1 = 2. The fourth region given by [6,3,2,2,1,1,1,1,1,1,1] has rank 6-11 = -5 (see below):
From _Omar E. Pol_, Aug 12 2013: (Start)
---------------------------------------------------------
.    Regions       Illustration of ranks of the regions
---------------------------------------------------------
.    For J=6        k=1     k=2      k=3        k=4
.  _ _ _ _ _ _                              _ _ _ _ _ _
. |_ _ _      |                     _ _ _   .          |
. |_ _ _|_    |           _ _ _ _   * * .|    .        |
. |_ _    |   |     _ _   * * .  |              .      |
. |_ _|_ _|_  |     * .|        .|                .    |
.           | |                                     .  |
.           | |                                       .|
.           | |                                       *|
.           | |                                       *|
.           | |                                       *|
.           | |                                       *|
.           |_|                                       *|
.
So row 6 lists:     1       2         2              -5
(End)
Written as a triangle begins:
0;
0;
0;
1,-1;
2,-2;
1,2,2,-5;
2,3,3,-8;
1,2,2,2,4,3,-14;
2,3,3,3,2,4,4,-21;
1,2,2,2,4,3,1,3,5,5,4,-32;
2,3,3,3,2,4,4,1,4,3,5,6,5,-45;
1,2,2,2,4,3,1,3,5,5,4,-2,2,4,4,5,3,6,6,5,-65;
2,3,3,3,2,4,4,1,4,3,5,6,5,-3,3,5,5,4,5,4,7,7,6,-88;

Row j has length A187219(j). The absolute value of the last term of row j is A000094(j+1). Row sums give A000004.

Cf. A000041, A002865, A135010, A138121, A138137, A138879, A186114, A186412, A193870, A194436, A194437, A194438, A194439, A194446, A206437.

a(n) = A141285(n) - A194446(n). - Omar E. Pol, Dec 05 2011

A186412 Sum of all parts in the n-th region of the set of partitions of j, if 1<=n<=A000041(j).

Original entry on oeis.org

1, 3, 5, 2, 9, 3, 12, 2, 6, 3, 20, 3, 7, 4, 25, 2, 6, 3, 13, 5, 4, 38, 3, 7, 4, 14, 3, 9, 5, 49, 2, 6, 3, 13, 5, 4, 23, 4, 10, 6, 5, 69, 3, 7, 4, 14, 3, 9, 5, 27, 5, 4, 15, 7, 6, 87, 2, 6, 3, 13, 5, 4, 23, 4, 10, 6, 5, 39, 3, 9, 5, 19, 4, 12, 7, 6, 123

Offset: 1

Omar E. Pol, Aug 12 2011

Also triangle read by rows: T(j,k) = sum of all parts in the k-th region of the last section of the set of partitions of j. See Example section. For more information see A135010. - Omar E. Pol, Nov 26 2011

For the definition of "region" see A206437. - Omar E. Pol, Aug 19 2013

			Contribution from Omar E. Pol, Nov 26 2011 (Start):
Written as a triangle:
1;
3;
5;
2,9;
3,12;
2,6,3,20;
3,7,4,25;
2,6,3,13,5,4,38;
3,7,4,14,3,9,5,49;
2,6,3,13,5,4,23,4,10,6,5,69;
3,7,4,14,3,9,5,27,5,4,15,7,6,87;
2,6,3,13,5,4,23,4,10,6,5,39,3,9,5,19,4,12,7,6,123;
(End)
From _Omar E. Pol_, Aug 18 2013: (Start)
Illustration of initial terms (first seven regions):
.                                             _ _ _ _ _
.                                     _ _ _  |_ _ _ _ _|
.                           _ _ _ _  |_ _ _|       |_ _|
.                     _ _  |_ _ _ _|                 |_|
.             _ _ _  |_ _|     |_ _|                 |_|
.       _ _  |_ _ _|             |_|                 |_|
.   _  |_ _|     |_|             |_|                 |_|
.  |_|   |_|     |_|             |_|                 |_|
.
.   1     3       5     2         9       3          12
.
(End)

Row sums of triangle A186114 and of triangle A193870.
Row j has length A187219(j).
Row sums give A138879.
Right border gives A046746, j >= 1.
Records give A046746, j >= 1.
Partial sums give A182244.
Cf. A000041, A002865, A066186, A135010, A138121, A138879, A194436, A194437, A194438, A194439, A194446, A194447.

lex[n_]:=DeleteCases[Sort@PadRight[Reverse /@ IntegerPartitions@n], x_ /; x==0,2];
A186412 = {}; l = {};
For[j = 1, j <= 50, j++,
  mx = Max@lex[j][[j]]; AppendTo[l, mx];
  For[i = j, i > 0, i--, If[l[[i]] > mx, Break[]]];
  AppendTo[A186412, Total@Take[Reverse[First /@ lex[mx]], j - i]];
  ];
A186412  (* Robert Price, Jul 25 2020 *)

a(A000041(n)) = A046746(n).

A211978 Total number of parts in all partitions of n plus the sum of largest parts of all partitions of n.

Original entry on oeis.org

0, 2, 6, 12, 24, 40, 70, 108, 172, 256, 384, 550, 798, 1112, 1560, 2136, 2926, 3930, 5288, 6996, 9260, 12104, 15798, 20412, 26348, 33702, 43044, 54588, 69090, 86906, 109126, 136270, 169854, 210732, 260924, 321752, 396028, 485624, 594402, 725174, 883092, 1072208

Offset: 0

Omar E. Pol, Jan 03 2013

nonn

Also twice A006128, because the total number of parts in all partitions of n equals the sum of largest parts of all partitions of n. For a proof without words see the illustration of initial terms. Note that the sum of the lengths of all horizontal segments equals the sum of largest parts of all partitions of n. On the other hand, the sum of the lengths of all vertical segments equals the total number of parts of all partition of n. Therefore the sum of lengths of all horizontal segments equals the sum of lengths of all vertical segments.
a(n) is also the sum of the semiperimeters of the Ferrers boards of the partitions of n. Example: a(2)=6; indeed, the Ferrers boards of the partitions [2] and [1,1] of 2 are 2x1 rectangles; the sum of their semiperimeters is 3 + 3 = 6. - Emeric Deutsch, Oct 07 2016
a(n) is also the sum of the semiperimeters of the regions of the set of partitions of n. See the first illustration in the Example section. For more information see A278355. - Omar E. Pol, Nov 23 2016

			Illustration of initial terms as a minimalist diagram of regions of the set of partitions of n, for n = 1..6:
.                                         _ _ _ _ _ _
.                                         _ _ _      |
.                                         _ _ _|_    |
.                                         _ _    |   |
.                             _ _ _ _ _   _ _|_ _|_  |
.                             _ _ _    |  _ _ _    | |
.                   _ _ _ _   _ _ _|_  |  _ _ _|_  | |
.                   _ _    |  _ _    | |  _ _    | | |
.           _ _ _   _ _|_  |  _ _|_  | |  _ _|_  | | |
.     _ _   _ _  |  _ _  | |  _ _  | | |  _ _  | | | |
. _   _  |  _  | |  _  | | |  _  | | | |  _  | | | | |
.  |   | |   | | |   | | | |   | | | | |   | | | | | |
.
. 2    6     12        24         40          70
.
Also using the elements from the diagram we can draw an infinite Dyck path in which the n-th odd-indexed segment has A141285(n) up-steps and the n-th even-indexed segment has A194446(n) down-steps. Note that the n-th largest peak between two valleys at height 0 is also the partition number A000041(n) as shown below:
.
11...........................................................
.                                                           /\
.                                                          /  \
.                                                         /    \
7..................................                      /      \
.                                 /\                    /        \
5....................            /  \                /\/          \
.                   /\          /    \          /\  /              \
3..........        /  \        /      \        /  \/                \
2.....    /\      /    \    /\/        \      /                      \
1..  /\  /  \  /\/      \  /            \  /\/                        \
0 /\/  \/    \/          \/              \/                            \
. 0,2,  6,   12,         24,             40,                          70...
.

Michael De Vlieger, Table of n, a(n) for n = 0..3000
Toufik Mansour, Armend Sh. Shabani, Enumerations on bargraphs, Discrete Math. Lett. (2019) Vol. 2, 65-94.
Omar E. Pol, Visualization of regions in a diagram for A006128
N. J. A. Sloane, Catalog of Toothpick and Cellular Automata Sequences in the OEIS
Index entries for sequences related to toothpick sequences

Cf. A139582 is twice A000041. A220909 is twice A066186.

Cf. A006128, A135010, A141285, A186114, A193870, A187219, A194446, A194447, A206437, A211026, A220517, A225600, A278355.

Q := sum(x^j/(1-x^j), j = 1 .. i): R := product(1-x^j, j = 1 .. i): g := sum(x^i*(1+i+Q)/R, i = 1 .. 100): gser := series(g, x = 0, 50): seq(coeff(gser, x, n), n = 0 .. 41); # Emeric Deutsch, Oct 07 2016

Array[2 Sum[DivisorSigma[0, m] PartitionsP[# - m], {m, #}] &, 42, 0] (* Michael De Vlieger, Mar 20 2020 *)

a(n) = 2*A006128(n).
a(n) = A225600(2*A000041(n)) = A225600(A139582(n)), n >= 1.
a(n) = (Sum_{m=1..p(n)} A194446(m)) + (Sum_{m=1..p(n)} A141285(m)) = 2*Sum_{m=1..p(n)} A194446(m) = 2*Sum_{m=1..p(n)} A141285(m), where p(n) = A000041(n), n >= 1.
The trivariate g.f. G(t,s,x) of the partitions of a nonnegative integer relative to weight (marked by x), number of parts (marked by t), and largest part (marked by s) is G(t,s,x) = Sum_{i>=1} t*s^i*x^i/product_{j=1..i} (1-tx^j). Setting s = t, we obtain the bivariate g.f. of the partitions relative to weight (marked by x) and semiperimeter of the Ferrers board (marked by t). The g.f. of a(n) is g(x) = Sum_{i>=1} ((x^i*(1 + i + Q(x))/R(x)), where Q(x) = sum_{j=1..i} (x^j/(1 - x^j)) and R(x) = product_{j=1..i}(1-x^j). g(x) has been obtained by setting t = 1 in dG(t,t,x))/dt. - Emeric Deutsch, Oct 07 2016

A225600 Toothpick sequence related to integer partitions (see Comments lines for definition).

Original entry on oeis.org

0, 1, 2, 4, 6, 9, 12, 14, 15, 19, 24, 27, 28, 33, 40, 42, 43, 47, 49, 52, 53, 59, 70, 73, 74, 79, 81, 85, 86, 93, 108, 110, 111, 115, 117, 120, 121, 127, 131, 136, 137, 141, 142, 150, 172, 175, 176, 181, 183, 187, 188, 195, 199, 202, 203, 209, 211, 216, 217, 226, 256

Offset: 0

Omar E. Pol, Jul 28 2013

nonn

This infinite toothpick structure is a minimalist diagram of regions of the set of partitions of all positive integers. For the definition of "region" see A206437. The sequence shows the growth of the diagram as a cellular automaton in which the "input" is A141285 and the "output” is A194446.
To define the sequence we use the following rules:
We start in the first quadrant of the square grid with no toothpicks.
If n is odd we place A141285((n+1)/2) toothpicks of length 1 connected by their endpoints in horizontal direction starting from the grid point (0, (n+1)/2).
If n is even we place toothpicks of length 1 connected by their endpoints in vertical direction starting from the exposed toothpick endpoint downward up to touch the structure or up to touch the x-axis. In this case the number of toothpicks added in vertical direction is equal to A194446(n/2).
The sequence gives the number of toothpicks after n stages. A220517 (the first differences) gives the number of toothpicks added at the n-th stage.
Also the toothpick structure (HV/HHVV/HHHVVV/HHV/HHHHVVVVV...) can be transformed in a Dyck path (UDUUDDUUUDDDUUDUUUUDDDDD...) in which the n-th odd-indexed segment has A141285(n) up-steps and the n-th even-indexed segment has A194446(n) down-steps, so the sequence can be represented by the vertices (or the number of steps from the origin) of the Dyck path. Note that the height of the n-th largest peak between two valleys at height 0 is also the partition number A000041(n). See Example section. See also A211978, A220517, A225610.

			For n = 30 the structure has 108 toothpicks, so a(30) = 108.
.                               Diagram of regions
Partitions of 7                 and partitions of 7
.                                   _ _ _ _ _ _ _
7                               15  _ _ _ _      |
4 + 3                               _ _ _ _|_    |
5 + 2                               _ _ _    |   |
3 + 2 + 2                           _ _ _|_ _|_  |
6 + 1                           11  _ _ _      | |
3 + 3 + 1                           _ _ _|_    | |
4 + 2 + 1                           _ _    |   | |
2 + 2 + 2 + 1                       _ _|_ _|_  | |
5 + 1 + 1                        7  _ _ _    | | |
3 + 2 + 1 + 1                       _ _ _|_  | | |
4 + 1 + 1 + 1                    5  _ _    | | | |
2 + 2 + 1 + 1 + 1                   _ _|_  | | | |
3 + 1 + 1 + 1 + 1                3  _ _  | | | | |
2 + 1 + 1 + 1 + 1 + 1            2  _  | | | | | |
1 + 1 + 1 + 1 + 1 + 1 + 1        1   | | | | | | |
.
.                                   1 2 3 4 5 6 7
.
Illustration of initial terms:
.
.                              _ _ _    _ _ _
.                _ _   _ _     _ _      _ _  |
.      _    _    _     _  |    _  |     _  | |
.            |    |     | |     | |      | | |
.
.      1    2     4     6       9        12
.
.
.                          _ _ _ _     _ _ _ _
.      _ _       _ _       _ _         _ _    |
.      _ _ _     _ _|_     _ _|_       _ _|_  |
.      _ _  |    _ _  |    _ _  |      _ _  | |
.      _  | |    _  | |    _  | |      _  | | |
.       | | |     | | |     | | |       | | | |
.
.        14        15         19          24
.
.
.                          _ _ _ _ _    _ _ _ _ _
.    _ _ _      _ _ _      _ _ _        _ _ _    |
.    _ _ _ _    _ _ _|_    _ _ _|_      _ _ _|_  |
.    _ _    |   _ _    |   _ _    |     _ _    | |
.    _ _|_  |   _ _|_  |   _ _|_  |     _ _|_  | |
.    _ _  | |   _ _  | |   _ _  | |     _ _  | | |
.    _  | | |   _  | | |   _  | | |     _  | | | |
.     | | | |    | | | |    | | | |      | | | | |
.
.       27         28         33            40
.
Illustration of initial terms as vertices (or the number of steps from the origin) of a Dyck path:
.
7                                    33
.                                    /\
5                      19           /  \
.                      /\          /    \
3            9        /  \     27 /      \
2       4    /\   14 /    \    /\/        \
1    1  /\  /  \  /\/      \  / 28         \
.    /\/  \/    \/ 15       \/              \
.   0  2   6    12          24              40
.

Omar E. Pol, Visualization of regions in a diagram for A006128
N. J. A. Sloane, Catalog of Toothpick and Cellular Automata Sequences in the OEIS
Index entries for sequences related to toothpick sequences

Cf. A000041, A006128, A135010, A138137, A139250, A139582, A141285, A186114, A186412, A187219, A194446, A194447, A206437, A207779, A211978, A220517, A225610.

a(A139582(n)) = a(2*A000041(n)) = 2*A006128(n) = A211978(n), n >= 1.

A225610 Total number of parts in all partitions of n plus the sum of largest parts in all partitions of n plus the number of partitions of n plus n.

Original entry on oeis.org

1, 4, 10, 18, 33, 52, 87, 130, 202, 295, 436, 617, 887, 1226, 1709, 2327, 3173, 4244, 5691, 7505, 9907, 12917, 16822, 21690, 27947, 35685, 45506, 57625, 72836, 91500, 114760, 143143, 178235, 220908, 273268, 336670, 414041, 507298, 620455, 756398, 920470

Offset: 0

Omar E. Pol, Jul 29 2013

nonn

a(n) is also the total number of toothpicks in a toothpick structure which represents a diagram of regions of the set of partitions of n, n >= 1. The number of horizontal toothpicks is A225596(n). The number of vertical toothpicks is A093694(n). The difference between vertical toothpicks and horizontal toothpicks is A000041(n) - n = A000094(n+1). The total area (or total number of cells) of the diagram is A066186(n). The number of parts in the k-th region is A194446(k). The area (or number of cells) of the k-th region is A186412(k). For the definition of "region" see A206437. For a minimalist version of the diagram (which can be transformed into a Dyck path) see A211978. See also A225600.

			For n = 7 the total number of parts in all partitions of 7 plus the sum of largest parts in all partitions of 7 plus the number of partitions of 7 plus 7 is equal to A006128(7) + A006128(7) + A000041(7) + 7 = 54 + 54 + 15 + 7 = 130. On the other hand the number of toothpicks in the diagram of regions of the set of partitions of 7 is equal to 130, so a(7) = 130.
.                               Diagram of regions
Partitions of 7                 and partitions of 7
.                                   _ _ _ _ _ _ _
7                               15 |_ _ _ _      |
4 + 3                              |_ _ _ _|_    |
5 + 2                              |_ _ _    |   |
3 + 2 + 2                          |_ _ _|_ _|_  |
6 + 1                           11 |_ _ _      | |
3 + 3 + 1                          |_ _ _|_    | |
4 + 2 + 1                          |_ _    |   | |
2 + 2 + 2 + 1                      |_ _|_ _|_  | |
5 + 1 + 1                        7 |_ _ _    | | |
3 + 2 + 1 + 1                      |_ _ _|_  | | |
4 + 1 + 1 + 1                    5 |_ _    | | | |
2 + 2 + 1 + 1 + 1                  |_ _|_  | | | |
3 + 1 + 1 + 1 + 1                3 |_ _  | | | | |
2 + 1 + 1 + 1 + 1 + 1            2 |_  | | | | | |
1 + 1 + 1 + 1 + 1 + 1 + 1        1 |_|_|_|_|_|_|_|
.
.                                   1 2 3 4 5 6 7
.
Illustration of initial terms as the number of toothpicks in a diagram of regions of the set of partitions of n, for n = 1..6:
.                                         _ _ _ _ _ _
.                                        |_ _ _      |
.                                        |_ _ _|_    |
.                                        |_ _    |   |
.                             _ _ _ _ _  |_ _|_ _|_  |
.                            |_ _ _    | |_ _ _    | |
.                   _ _ _ _  |_ _ _|_  | |_ _ _|_  | |
.                  |_ _    | |_ _    | | |_ _    | | |
.           _ _ _  |_ _|_  | |_ _|_  | | |_ _|_  | | |
.     _ _  |_ _  | |_ _  | | |_ _  | | | |_ _  | | | |
. _  |_  | |_  | | |_  | | | |_  | | | | |_  | | | | |
.|_| |_|_| |_|_|_| |_|_|_|_| |_|_|_|_|_| |_|_|_|_|_|_|
.
. 4    10     18       33         52          87

Omar E. Pol, Illustration of the seven regions of 5
N. J. A. Sloane, Catalog of Toothpick and Cellular Automata Sequences in the OEIS
Index entries for sequences related to toothpick sequences

Cf. A000041, A000094, A006128, A066186, A093694, A133041, A135010, A138137, A139250, A139582, A141285, A182377, A186114, A186412, A187219, A194446, A194447, A206437, A207779, A211978, A220517, A225596, A225600.

a(n) = 2*A006128(n) + A000041(n) + n = A211978(n) + A133041(n) = A093694(n) + A006128(n) + n = A093694(n) + A225596(n).

A194436 Triangle read by rows: T(n,k) = number of parts in the k-th region of n.

Original entry on oeis.org

1, 1, 2, 1, 2, 3, 1, 2, 3, 1, 5, 1, 2, 3, 1, 5, 1, 7, 1, 2, 3, 1, 5, 1, 7, 1, 2, 1, 11, 1, 2, 3, 1, 5, 1, 7, 1, 2, 1, 11, 1, 2, 1, 15, 1, 2, 3, 1, 5, 1, 7, 1, 2, 1, 11, 1, 2, 1, 15, 1, 2, 1, 4, 1, 1, 22, 1, 2, 3, 1, 5, 1, 7, 1, 2, 1, 11, 1, 2, 1, 15

Offset: 1

Omar E. Pol, Nov 27 2011

			Triangle begins:
1;
1,2;
1,2,3;
1,2,3,1,5;
1,2,3,1,5,1,7;
1,2,3,1,5,1,7,1,2,1,11;
1,2,3,1,5,1,7,1,2,1,11,1,2,1,15;
1,2,3,1,5,1,7,1,2,1,11,1,2,1,15,1,2,1,4,1,1,22;
...
Row n has length A000041(n). Row sums give A006128, n >= 1. Right border gives A000041, n >= 1. Records in every row give A000041, n >= 1. Rows converge to A194446.

Cf. A000041, A006128, A135010, A138121, A186114, A186412, A193870, A194437, A194438, A194439, A194446, A194447.

cp's OEIS Frontend

A211992 Triangle read by rows in which row n lists the partitions of n in colexicographic order.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

A225620 Indices of partitions in the table of compositions of A228351.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Formula

A186114 Triangle of regions and partitions of integers (see Comments lines for definition).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Formula

A193870 Triangle of regions and partitions of integers (see Comments lines for definition).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Formula

A194447 Rank of the n-th region of the set of partitions of j, if 1<=n<=A000041(j).

Views

Author

Keywords

Comments

Examples

Crossrefs

Formula

A186412 Sum of all parts in the n-th region of the set of partitions of j, if 1<=n<=A000041(j).

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Formula

A211978 Total number of parts in all partitions of n plus the sum of largest parts of all partitions of n.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

Formula

A225600 Toothpick sequence related to integer partitions (see Comments lines for definition).

Views

Author

Keywords

Comments

Examples