A221529 -id:A221529 - cp's OEIS frontend

A338156 Irregular triangle read by rows in which row n lists n blocks, where the m-th block consists of A000041(m-1) copies of the divisors of (n - m + 1), with 1 <= m <= n.

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

Offset: 1

Omar E. Pol, Oct 14 2020

In other words: in row n replace every term of n-th row of A176206 with its divisors.
The terms in row n are also all parts of all partitions of n.
As in A336812 here we introduce a new type of table which shows the correspondence between divisors and partitions. More precisely the table shows the correspondence between all divisors of all terms of the n-th row of A176206 and all parts of all partitions of n, with n >= 1. Both the mentionded divisors and the mentioned parts are the same numbers (see Example section). That is because all divisors of the first A000070(n-1) terms of A336811 are also all parts of all partitions of n.
For an equivalent table for all parts of the last section of the set of partitions of n see the subsequence A336812. The section is the smallest substructure of the set of partitions in which appears the correspondence divisor/part.
From Omar E. Pol, Aug 01 2021: (Start)
The terms of row n appears in the triangle A346741 ordered in accordance with the successive sections of the set of partitions of n.
The terms of row n in nonincreasing order give the n-th row of A302246.
The terms of row n in nondecreasing order give the n-th row of A302247.
For the connection with the tower described in A221529 see also A340035. (End)

			Triangle begins:
  [1];
  [1,2],   [1];
  [1,3],   [1,2],   [1],   [1];
  [1,2,4], [1,3],   [1,2], [1,2], [1],   [1],   [1];
  [1,5],   [1,2,4], [1,3], [1,3], [1,2], [1,2], [1,2], [1], [1], [1], [1], [1];
  ...
For n = 5 the 5th row of A176206 is [5, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1] so replacing every term with its divisors we have the 5th row of this triangle.
Also, if the sequence is written as an irregular tetrahedron so the first six slices are:
  [1],
  -------
  [1, 2],
  [1],
  -------
  [1, 3],
  [1, 2],
  [1],
  [1];
  ----------
  [1, 2, 4],
  [1, 3],
  [1, 2],
  [1, 2],
  [1],
  [1],
  [1];
  ----------
  [1, 5],
  [1, 2, 4],
  [1, 3],
  [1, 3],
  [1, 2],
  [1, 2],
  [1, 2],
  [1],
  [1],
  [1],
  [1],
  [1];
.
The above slices appear in the lower zone of the following table which shows the correspondence between the mentioned divisors and all parts of all partitions of the positive integers.
The table is infinite. It is formed by three zones as follows:
The upper zone shows the partitions of every positive integer in colexicographic order (cf. A026792, A211992).
The lower zone shows the same numbers but arranged as divisors in accordance with the slices of the tetrahedron mentioned above.
Finally the middle zone shows the connection between the upper zone and the lower zone.
For every positive integer the numbers in the upper zone are the same numbers as in the lower zone.
.
|---|---------|-----|-------|---------|------------|---------------|
| n |         |  1  |   2   |    3    |      4     |       5       |
|---|---------|-----|-------|---------|------------|---------------|
| P |         |     |       |         |            |               |
| A |         |     |       |         |            |               |
| R |         |     |       |         |            |               |
| T |         |     |       |         |            |  5            |
| I |         |     |       |         |            |  3  2         |
| T |         |     |       |         |  4         |  4  1         |
| I |         |     |       |         |  2  2      |  2  2  1      |
| O |         |     |       |  3      |  3  1      |  3  1  1      |
| N |         |     |  2    |  2 1    |  2  1 1    |  2  1  1 1    |
| S |         |  1  |  1 1  |  1 1 1  |  1  1 1 1  |  1  1  1 1 1  |
----|---------|-----|-------|---------|------------|---------------|
.
|---|---------|-----|-------|---------|------------|---------------|
|   | A181187 |  1  |  3 1  |  6 2 1  | 12  5 2 1  | 20  8  4 2 1  |
|   |         |  |  |  |/|  |  |/|/|  |  |/ |/|/|  |  |/ | /|/|/|  |
| L | A066633 |  1  |  2 1  |  4 1 1  |  7  3 1 1  | 12  4  2 1 1  |
| I |         |  *  |  * *  |  * * *  |  *  * * *  |  *  *  * * *  |
| N | A002260 |  1  |  1 2  |  1 2 3  |  1  2 3 4  |  1  2  3 4 5  |
| K |         |  =  |  = =  |  = = =  |  =  = = =  |  =  =  = = =  |
|   | A138785 |  1  |  2 2  |  4 2 3  |  7  6 3 4  | 12  8  6 4 5  |
|   |         |  |  |  |\|  |  |\|\|  |  |\ |\|\|  |  |\ |\ |\|\|  |
|   | A206561 |  1  |  4 2  |  9 5 3  | 20 13 7 4  | 35 23 15 9 5  |
|---|---------|-----|-------|---------|------------|---------------|
.
|---|---------|-----|-------|---------|------------|---------------|
|   | A027750 |  1  |  1 2  |  1   3  |  1  2   4  |  1         5  |
|   |---------|-----|-------|---------|------------|---------------|
|   | A027750 |     |  1    |  1 2    |  1    3    |  1  2    4    |
|   |---------|-----|-------|---------|------------|---------------|
| D | A027750 |     |       |  1      |  1  2      |  1     3      |
| I | A027750 |     |       |  1      |  1  2      |  1     3      |
| V |---------|-----|-------|---------|------------|---------------|
| I | A027750 |     |       |         |  1         |  1  2         |
| S | A027750 |     |       |         |  1         |  1  2         |
| O | A027750 |     |       |         |  1         |  1  2         |
| R |---------|-----|-------|---------|------------|---------------|
| S | A027750 |     |       |         |            |  1            |
|   | A027750 |     |       |         |            |  1            |
|   | A027750 |     |       |         |            |  1            |
|   | A027750 |     |       |         |            |  1            |
|   | A027750 |     |       |         |            |  1            |
|---|---------|-----|-------|---------|------------|---------------|
.
Note that every row in the lower zone lists A027750.
Also the lower zone for every positive integer can be constructed using the first n terms of the partition numbers. For example: for n = 5 we consider the first 5 terms of A000041 (that is [1, 1, 2, 3, 5]) then the 5th slice is formed by a block with the divisors of 5, one block with the divisors of 4, two blocks with the divisors of 3, three blocks with the divisors of 2, and five blocks with the divisors of 1.
Note that the lower zone is also in accordance with the tower (a polycube) described in A221529 in which its terraces are the symmetric representation of sigma starting from the top (cf. A237593) and the heights of the mentioned terraces are the partition numbers A000041 starting from the base.
The tower has the same volume (also the same number of cubes) equal to A066186(n) as a prism of partitions of size 1*n*A000041(n).
The above table shows the correspondence between the prism of partitions and its associated tower since the number of parts in all partitions of n is equal to A006128(n) equaling the number of divisors in the n-th slice of the lower table and equaling the same the number of terms in the n-th row of triangle. Also the sum of all parts of all partitions of n is equal to A066186(n) equaling the sum of all divisors in the n-th slice of the lower table and equaling the sum of the n-th row of triangle.

Paolo Xausa, Table of n, a(n) for n = 1..13185 (rows 1..19 of triangle, flattened)

Nonzero terms of A340031.
Row n has length A006128(n).
The sum of row n is A066186(n).
The product of row n is A007870(n).
Row n lists the first n rows of A336812 (a subsequence).
The number of parts k in row n is A066633(n,k).
The sum of all parts k in row n is A138785(n,k).
The number of parts >= k in row n is A181187(n,k).
The sum of all parts >= k in row n is A206561(n,k).
The number of parts <= k in row n is A210947(n,k).
The sum of all parts <= k in row n is A210948(n,k).
Cf. A000070, A000041, A002260, A026792, A027750, A058399, A127093, A135010, A138121, A176206, A182703, A206437, A207031, A207383, A211992, A221529, A221530, A221531, A245095, A221649, A221650, A237593, A302246, A302247, A336811, A337209, A339106, A339258, A339278, A339304, A340035, A340061, A346741.

A338156[rowmax_]:=Table[Flatten[Table[ConstantArray[Divisors[n-m],PartitionsP[m]],{m,0,n-1}]],{n,rowmax}];
A338156[10] (* Generates 10 rows *) (* Paolo Xausa, Jan 12 2023 *)

A338156(rowmax)=vector(rowmax,n,concat(vector(n,m,concat(vector(numbpart(m-1),i,divisors(n-m+1))))));
A338156(10) \\ Generates 10 rows - Paolo Xausa, Feb 17 2023

A336812 Irregular triangle read by rows T(n,k), n >= 1, k >= 1, in which row n is constructed replacing every term of row n of A336811 with its divisors.

Original entry on oeis.org

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

Offset: 1

Omar E. Pol, Nov 20 2020

Here we introduce a new type of table which shows the correspondence between divisors and partitions. More precisely the table shows the corresponce between all parts of the last section of the set of partitions of n and all divisors of all terms of the n-th row of A336811, with n >= 1. The mentionded parts and the mentioned divisors are the same numbers (see Example section).

For an equivalent table showing the same kind of correspondence for all partitions of all positive integers see the supersequence A338156.

			Triangle begins:
  [1];
  [1, 2];
  [1, 3],       [1];
  [1, 2, 4],    [1, 2],    [1];
  [1, 5],       [1, 3],    [1, 2], [1],    [1];
  [1, 2, 3, 6], [1, 2, 4], [1, 3], [1, 2], [1, 2], [1], [1];
  ...
For n = 6 the 6th row of A336811 is [6, 4, 3, 2, 2, 1, 1] so replacing every term with its divisors we have {[1, 2, 3, 6], [1, 2, 4], [1, 3], [1, 2], [1, 2], [1], [1]} the same as the 6th row of this triangle.
Also, if the sequence is written as an irregular tetrahedron so the first six slices are:
  -------------
  [1],
  -------------
  [1, 2];
  -------------
  [1, 3],
  [1];
  -------------
  [1, 2, 4],
  [1, 2],
  [1];
  -------------
  [1, 5],
  [1, 3],
  [1, 2],
  [1],
  [1];
  -------------
  [1, 2, 3, 6],
  [1, 2, 4],
  [1, 3],
  [1, 2],
  [1, 2],
  [1],
  [1];
  -------------
The above slices appear in the lower zone of the following table which shows the correspondence between the mentioned divisors and the parts of the last section of the set of partitions of the positive integers.
The table is infinite. It is formed by three zones as follows:
The upper zone shows the last section of the set of partitions of every positive integer.
The lower zone shows the same numbers but arranged as divisors in accordance with the slices of the tetrahedron mentioned above.
Finally the middle zone shows the connection between the upper zone and the lower zone.
For every positive integer the numbers in the upper zone are the same numbers as in the lower zone.
|---|---------|-----|-------|---------|-----------|-------------|---------------|
| n |         |  1  |   2   |    3    |     4     |      5      |       6       |
|---|---------|-----|-------|---------|-----------|-------------|---------------|
|   |         |     |       |         |           |             |  6            |
| P |         |     |       |         |           |             |  3 3          |
| A |         |     |       |         |           |             |  4 2          |
| R |         |     |       |         |           |             |  2 2 2        |
| T |         |     |       |         |           |  5          |    1          |
| I |         |     |       |         |           |  3 2        |      1        |
| T |         |     |       |         |  4        |    1        |      1        |
| I |         |     |       |         |  2 2      |      1      |        1      |
| O |         |     |       |  3      |    1      |      1      |        1      |
| N |         |     |  2    |    1    |      1    |        1    |          1    |
| S |         |  1  |    1  |      1  |        1  |          1  |            1  |
|---|---------|-----|-------|---------|-----------|-------------|---------------|
.
|---|---------|-----|-------|---------|-----------|-------------|---------------|
|   | A207031 |  1  |  2 1  |  3 1 1  |  6 3 1 1  |  8 3 2 1 1  | 15 8 4 2 1 1  |
| L |         |  |  |  |/|  |  |/|/|  |  |/|/|/|  |  |/|/|/|/|  |  |/|/|/|/|/|  |
| I | A182703 |  1  |  1 1  |  2 0 1  |  3 2 0 1  |  5 1 1 0 1  |  7 4 2 1 0 1  |
| N |         |  *  |  * *  |  * * *  |  * * * *  |  * * * * *  |  * * * * * *  |
| K | A002260 |  1  |  1 2  |  1 2 3  |  1 2 3 4  |  1 2 3 4 5  |  1 2 3 4 5 6  |
|   |         |  =  |  = =  |  = = =  |  = = = =  |  = = = = =  |  = = = = = =  |
|   | A207383 |  1  |  1 2  |  2 0 3  |  3 4 0 4  |  5 2 3 0 5  |  7 8 6 4 0 6  |
|---|---------|-----|-------|---------|-----------|-------------|---------------|
.
|---|---------|-----|-------|---------|-----------|-------------|---------------|
|   | A027750 |  1  |  1 2  |  1   3  |  1 2   4  |  1       5  |  1 2 3     6  |
| D |---------|-----|-------|---------|-----------|-------------|---------------|
| I | A027750 |     |       |  1      |  1 2      |  1   3      |  1 2   4      |
| V |---------|-----|-------|---------|-----------|-------------|---------------|
| I | A027750 |     |       |         |  1        |  1 2        |  1   3        |
| S |---------|-----|-------|---------|-----------|-------------|---------------|
| O | A027750 |     |       |         |           |  1          |  1 2          |
| R | A027750 |     |       |         |           |  1          |  1 2          |
| S |---------|-----|-------|---------|-----------|-------------|---------------|
|   | A027750 |     |       |         |           |             |  1            |
|   | A027750 |     |       |         |           |             |  1            |
|---|---------|-----|-------|---------|-----------|-------------|---------------|
.
Note that every row in the lower zone lists A027750.
The "section" is the simpler substructure of the set of partitions of n that has this property in the three zones.
Also the lower zone for every positive integer can be constructed using the first n terms of A002865. For example: for n = 6 we consider the first 6 terms of A002865 (that is [1, 0, 1, 1, 2, 2]) and then the 6th slice is formed by a block with the divisors of 6, no block with the divisors of 5, one block with the divisors of 4, one block with the divisors of 3, two blocks with the divisors of 2 and two blocks with the divisors of 1.
Note that the lower zone is also in accordance with the tower (a polycube) described in A221529 in which its terraces are the symmetric representation of sigma starting from the top (cf. A237593) and the heights of the mentioned terraces are the partition numbers A000041 starting from the base.
The tower has the same volume (also the same number of cubes) equal to A066186(n) as a prism of partitions of size 1*n*A000041(n).
The above table shows the growth step by step of both the prism of partitions and its associated tower since the number of parts in the last section of the set of partitions of n is equal to A138137(n) equaling the number of divisors in the n-th slice of the lower table and equaling the same the number of terms in the n-th row of triangle. Also the sum of all parts in the last section of the set of partitions of n is equal to A138879(n) equaling the sum of all divisors in the n-th slice of the lower table and equaling the sum of the n-th row of triangle.

Paolo Xausa, Table of n, a(n) for n = 1..10206 (rows 1..23 of triangle, flattened)

Companion and subsequence of A338156.
Row lengths give A138137.
Row sums give A138879.
Cf. A000041, A000070, A002260, A002865, A006128, A024916, A027750, A066186, A066633, A127093, A135010, A138121, A138785, A176206, A181187, A182703, A187219, A207031, A207038, A207383, A221529, A221530, A221531, A237593, A245095, A221649, A221650, A302246, A302247, A336811, A337209, A339106, A339258, A339278, A339304, A340035, A340061, A350357.

A336812[row_]:=Flatten[Table[ConstantArray[Divisors[row-m],PartitionsP[m]-PartitionsP[m-1]],{m,0,row-1}]];
Array[A336812,10] (* Generates 10 rows *) (* Paolo Xausa, Feb 16 2023 *)

A340035 Irregular triangle read by rows T(n,k) in which row n lists n blocks, where the m-th block consists of A000041(n-m) copies of the divisors of m, with 1 <= m <= n.

Original entry on oeis.org

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

Offset: 1

Omar E. Pol, Dec 26 2020

For further information about the correspondence divisor/part see A338156.

			Triangle begins:
  1;
  1, 1, 2;
  1, 1, 1, 2, 1, 3;
  1, 1, 1, 1, 2, 1, 2, 1, 3, 1, 2, 4;
  1, 1, 1, 1, 1, 1, 2, 1, 2, 1, 2, 1, 3, 1, 3, 1, 2, 4, 1, 5;
  ...
Written as an irregular tetrahedron the first five slices are:
  1;
  --
  1,
  1, 2;
  -----
  1,
  1,
  1, 2
  1, 3;
  -----
  1,
  1,
  1,
  1, 2,
  1, 2,
  1, 3,
  1, 2, 4;
  --------
  1,
  1,
  1,
  1,
  1,
  1, 2,
  1, 2,
  1, 2,
  1, 3,
  1, 3,
  1, 2, 4,
  1, 5;
--------
The slices of the tetrahedron appear in the upper zone of the following table (formed by three zones) which shows the correspondence between divisors and parts (n = 1..5):
.
|---|---------|-----|-------|---------|-----------|-------------|
| n |         |  1  |   2   |    3    |     4     |      5      |
|---|---------|-----|-------|---------|-----------|-------------|
|   | A027750 |     |       |         |           |  1          |
|   | A027750 |     |       |         |           |  1          |
|   | A027750 |     |       |         |           |  1          |
|   | A027750 |     |       |         |           |  1          |
| D | A027750 |     |       |         |           |  1          |
| I |---------|-----|-------|---------|-----------|-------------|
| V | A027750 |     |       |         |  1        |  1 2        |
| I | A027750 |     |       |         |  1        |  1 2        |
| S | A027750 |     |       |         |  1        |  1 2        |
| O |---------|-----|-------|---------|-----------|-------------|
| R | A027750 |     |       |  1      |  1 2      |  1   3      |
| S | A027750 |     |       |  1      |  1 2      |  1   3      |
|   |---------|-----|-------|---------|-----------|-------------|
|   | A027750 |     |  1    |  1 2    |  1   3    |  1 2   4    |
|   |---------|-----|-------|---------|-----------|-------------|
|   | A027750 |  1  |  1 2  |  1   3  |  1 2   4  |  1       5  |
|---|---------|-----|-------|---------|-----------|-------------|
.
|---|---------|-----|-------|---------|-----------|-------------|
|   | A138785 |  1  |  2 2  |  4 2 3  |  7 6 3 4  | 12 8 6 4 5  |
|   |         |  =  |  = =  |  = = =  |  = = = =  |  = = = = =  |
| L | A002260 |  1  |  1 2  |  1 2 3  |  1 2 3 4  |  1 2 3 4 5  |
| I |         |  *  |  * *  |  * * *  |  * * * *  |  * * * * *  |
| N | A066633 |  1  |  2 1  |  4 1 1  |  7 3 1 1  | 12 4 2 1 1  |
| K |         |  |  |  |\|  |  |\|\|  |  |\|\|\|  |  |\|\|\|\|  |
|   | A181187 |  1  |  3 1  |  6 2 1  | 12 5 2 1  | 20 8 4 2 1  |
|---|---------|-----|-------|---------|-----------|-------------|
.
|---|---------|-----|-------|---------|-----------|-------------|
| P |         |  1  |  1 1  |  1 1 1  |  1 1 1 1  |  1 1 1 1 1  |
| A |         |     |  2    |  2 1    |  2 1 1    |  2 1 1 1    |
| R |         |     |       |  3      |  3 1      |  3 1 1      |
| T |         |     |       |         |  2 2      |  2 2 1      |
| I |         |     |       |         |  4        |  4 1        |
| T |         |     |       |         |           |  3 2        |
| I |         |     |       |         |           |  5          |
| O |         |     |       |         |           |             |
| N |         |     |       |         |           |             |
| S |         |     |       |         |           |             |
|---|---------|-----|-------|---------|-----------|-------------|
.
The table is essentially the same table of A340032 but here, in the upper zone, every row is A027750 instead of A127093.
Also the above table is the table of A338156 upside down.
The connection with the tower described in A221529 is as follows (n = 7):
|--------|------------------------|
| Level  |                        |
| in the | 7th slice of divisors  |
| tower  |                        |
|--------|------------------------|
|  11    |   1,                   |
|  10    |   1,                   |
|   9    |   1,                   |
|   8    |   1,                   |
|   7    |   1,                   |
|   6    |   1,                   |
|   5    |   1,                   |
|   4    |   1,                   |
|   3    |   1,                   |
|   2    |   1,                   |
|   1    |   1,                   |
|--------|------------------------|
|   7    |   1, 2,                |
|   6    |   1, 2,                |
|   5    |   1, 2,                |
|   4    |   1, 2,                |
|   3    |   1, 2,                |
|   2    |   1, 2,                |
|   1    |   1, 2,                |
|--------|------------------------|
|   5    |   1,    3,             |
|   4    |   1,    3,             |
|   3    |   1,    3,             |
|   2    |   1,    3,             |      Level
|   1    |   1,    3,             |             _
|--------|------------------------|       11   | |
|   3    |   1, 2,    4,          |       10   | |
|   2    |   1, 2,    4,          |        9   | |
|   1    |   1, 2,    4,          |        8   |_|_
|--------|------------------------|        7   |   |
|   2    |   1,          5,       |        6   |_ _|_
|   1    |   1,          5,       |        5   |   | |
|--------|------------------------|        4   |_ _|_|_
|   1    |   1, 2, 3,       6,    |        3   |_ _ _| |_
|--------|------------------------|        2   |_ _ _|_ _|_ _
|   1    |   1,                7; |        1   |_ _ _ _|_|_ _|
|--------|------------------------|
             Figure 1.                            Figure 2.
                                                Lateral view
                                                of the tower.
.
                                                _ _ _ _ _ _ _
                                               |_| | | | |   |
                                               |_ _|_| | |   |
                                               |_ _|  _|_|   |
                                               |_ _ _|    _ _|
                                               |_ _ _|  _|
                                               |       |
                                               |_ _ _ _|
.
                                                  Figure 3.
                                                  Top view
                                                of the tower.
.
Figure 1 shows the terms of the 7th row of the triangle arranged as the 7th slice of the tetrahedron. The left hand column (see figure 1) gives the level of the sum of the divisors in the tower (see figures 2 and 3).

Paolo Xausa, Table of n, a(n) for n = 1..17815 (rows 1..20 of triangle, flattened)

Nonzero terms of A340032.
Row lengths give A006128, n >= 1.
Row sums give A066186, n >= 1.
Cf. A000041, A002260, A027750, A066633, A127093, A135010, A138121, A138785, A176206, A181187, A182703, A206437, A207031, A207383, A221529, A221530, A221531, A221649, A236104, A237593, A245092, A245095, A221649, A221650, A302246, A302247, A336811, A336812, A337209, A338156, A339106, A339258, A339278, A339304, A340011, A340031, A340032, A340056, A340057, A340061.

A340035row[n_]:=Flatten[Array[ConstantArray[Divisors[#],PartitionsP[n-#]]&,n]];
nrows=7;Array[A340035row,nrows] (* Paolo Xausa, Jun 20 2022 *)

A339278 Irregular triangle read by rows T(n,k), (n >= 1, k >= 1), in which the partition number A000041(n-1) is the length of row n and every column k is A000203, the sum of divisors function.

Original entry on oeis.org

1, 3, 4, 1, 7, 3, 1, 6, 4, 3, 1, 1, 12, 7, 4, 3, 3, 1, 1, 8, 6, 7, 4, 4, 3, 3, 1, 1, 1, 1, 15, 12, 6, 7, 7, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 13, 8, 12, 6, 6, 7, 7, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 18, 15, 8, 12, 12, 6, 6, 7, 7, 7, 7, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1

Offset: 1

Omar E. Pol, Nov 29 2020

The sum of row n equals A138879(n), the sum of all parts in the last section of the set of partitions of n.

T(n,k) is also the number of cubic cells (or cubes) added at the n-th stage in the k-th level starting from the base in the tower described in A221529, assuming that the tower is an object under construction (see the example). - Omar E. Pol, Jan 20 2022

			Triangle begins:
   1;
   3;
   4,  1;
   7,  3,  1;
   6,  4,  3, 1, 1;
  12,  7,  4, 3, 3, 1, 1;
   8,  6,  7, 4, 4, 3, 3, 1, 1, 1, 1;
  15, 12,  6, 7, 7, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1;
  13,  8, 12, 6, 6, 7, 7, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1;
...
From _Omar E. Pol_, Jan 13 2022: (Start)
Illustration of the first six rows of triangle showing the growth of the symmetric tower described in A221529:
    Level k: 1              2         3        4       5      6     7
Stage
  n   _ _ _ _ _ _ _ _
     |            _  |
  1  |           |_| |
     |_ _ _ _ _ _ _ _|
     |          _    |
     |         | |_  |
  2  |         |_ _| |
     |_ _ _ _ _ _ _ _|_ _ _ _ _ _
     |        _      |        _  |
     |       | |     |       |_| |
  3  |       |_|_ _  |           |
     |         |_ _| |           |
     |_ _ _ _ _ _ _ _|_ _ _ _ _ _|_ _ _ _ _
     |      _        |      _    |      _  |
     |     | |       |     | |_  |     |_| |
  4  |     | |_      |     |_ _| |         |
     |     |_  |_ _  |           |         |
     |       |_ _ _| |           |         |
     |_ _ _ _ _ _ _ _|_ _ _ _ _ _|_ _ _ _ _|_ _ _ _ _ _ _ _
     |    _          |    _      |    _    |    _  |    _  |
     |   | |         |   | |     |   | |_  |   |_| |   |_| |
     |   | |         |   |_|_ _  |   |_ _| |       |       |
  5  |   |_|_        |     |_ _| |         |       |       |
     |       |_ _ _  |           |         |       |       |
     |       |_ _ _| |           |         |       |       |
     |_ _ _ _ _ _ _ _|_ _ _ _ _ _|_ _ _ _ _|_ _ _ _|_ _ _ _|_ _ _ _ _ _
     |  _            |  _        |  _      |  _    |  _    |  _  |  _  |
     | | |           | | |       | | |     | | |_  | | |_  | |_| | |_| |
     | | |           | | |_      | |_|_ _  | |_ _| | |_ _| |     |     |
     | | |_ _        | |_  |_ _  |   |_ _| |       |       |     |     |
  6  | |_    |       |   |_ _ _| |         |       |       |     |     |
     |   |_  |_ _ _  |           |         |       |       |     |     |
     |     |_ _ _ _| |           |         |       |       |     |     |
     |_ _ _ _ _ _ _ _|_ _ _ _ _ _|_ _ _ _ _|_ _ _ _|_ _ _ _|_ _ _|_ _ _|
.
Every cell in the diagram of the symmetric representation of sigma represents a cubic cell or cube.
For n = 6 and k = 3 we add four cubes at 6th stage in the third level of the structure of the tower starting from the base so T(6,3) = 4.
For n = 9 another connection with the tower is as follows:
First we take the columns from the above triangle and build a new triangle in which all columns start at row 1 as shown below:
.
   1,  1,  1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1;
   3,  3,  3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3;
   4,  4,  4, 4, 4, 4, 4, 4, 4, 4, 4;
   7,  7,  7, 7, 7, 7, 7;
   6,  6,  6, 6, 6;
  12, 12, 12;
   8,  8;
  15;
  13;
.
Then we rotate the triangle by 90 degrees as shown below:
                                       _
  1;                                  | |
  1;                                  | |
  1;                                  | |
  1;                                  | |
  1;                                  | |
  1;                                  | |
  1;                                  |_|_
  1, 3;                               |   |
  1, 3;                               |   |
  1, 3;                               |   |
  1, 3;                               |_ _|_
  1, 3, 4;                            |   | |
  1, 3, 4;                            |   | |
  1, 3, 4;                            |   | |
  1, 3, 4;                            |_ _|_|_
  1, 3, 4, 7;                         |     | |
  1, 3, 4, 7;                         |_ _ _| |_
  1, 3, 4, 7, 6;                      |     |   |
  1, 3, 4, 7, 6;                      |_ _ _|_ _|_
  1, 3, 4, 7, 6, 12;                  |_ _ _ _| | |_
  1, 3, 4, 7, 6, 12, 8;               |_ _ _ _|_|_ _|_ _
  1, 3, 4, 7, 6, 12, 8, 15; 13;       |_ _ _ _ _|_ _|_ _|
.
                                         Lateral view
                                         of the tower
.                                      _ _ _ _ _ _ _ _ _
                                      |_| | | | | | |   |
                                      |_ _|_| | | | |   |
                                      |_ _|  _|_| | |   |
                                      |_ _ _|    _|_|   |
                                      |_ _ _|  _|    _ _|
                                      |_ _ _ _|     |
                                      |_ _ _ _|  _ _|
                                      |         |
                                      |_ _ _ _ _|
.
                                           Top view
                                         of the tower
.
The sum of the m-th row of the new triangle equals A024916(j) where j is the length of the m-th row, equaling the number of cubic cells in the m-th level of the tower. For example: the last row of triangle has 9 terms and the sum of the last row is 1 + 3 + 4 + 7 + 6 + 12 + 8 + 15 + 13 = A024916(9) = 69, equaling the number of cubes in the base of the tower. (End)

Paolo Xausa, Table of n, a(n) for n = 1..11732 (rows 1..27 of triangle, flattened)

Sum of divisors of A336811.
Row n has length A000041(n-1).
Every column gives A000203.
The length of the m-th block in row n is A187219(m), m >= 1.
Row sums give A138879.
Cf. A337209 (another version).
Cf. A272172 (analog for the stepped pyramid described in A245092).
Cf. A024916, A135010, A138121, A138137, A138785, A221529, A235791, A236104, A237270, A237591, A237593, A238442, A338156, A340423, A345023.

A339278[rowmax_]:=Table[Flatten[Table[ConstantArray[DivisorSigma[1,n-m],PartitionsP[m]-PartitionsP[m-1]],{m,0,n-1}]],{n,rowmax}];
A339278[15] (* Generates 15 rows *) (* Paolo Xausa, Feb 17 2023 *)

f(n) = numbpart(n-1);
T(n, k) = {if (k > f(n), error("invalid k")); if (k==1, return (sigma(n))); my(s=0); while (k <= f(n-1), s++; n--;); sigma(1+s);}
tabf(nn) = {for (n=1, nn, for (k=1, f(n), print1(T(n,k), ", ");); print;);} \\ Michel Marcus, Jan 13 2021

A339278(rowmax)=vector(rowmax,n,concat(vector(n,m,vector(numbpart(m-1)-numbpart(m-2),i,sigma(n-m+1)))));
A339278(15) \\ Generates 15 rows \\ Paolo Xausa, Feb 17 2023

a(m) = A000203(A336811(m)).

T(n,k) = A000203(A336811(n,k)).

A221530 Triangle read by rows: T(n,k) = A000005(k)*A000041(n-k).

Original entry on oeis.org

1, 1, 2, 2, 2, 2, 3, 4, 2, 3, 5, 6, 4, 3, 2, 7, 10, 6, 6, 2, 4, 11, 14, 10, 9, 4, 4, 2, 15, 22, 14, 15, 6, 8, 2, 4, 22, 30, 22, 21, 10, 12, 4, 4, 3, 30, 44, 30, 33, 14, 20, 6, 8, 3, 4, 42, 60, 44, 45, 22, 28, 10, 12, 6, 4, 2, 56, 84, 60, 66, 30, 44, 14, 20, 9, 8, 2, 6

Offset: 1

Omar E. Pol, Jan 19 2013

T(n,k) is the number of partitions of n that contain k as a part multiplied by the number of divisors of k.
It appears that T(n,k) is also the total number of appearances of k in the last k sections of the set of partitions of n multiplied by the number of divisors of k.
T(n,k) is also the number of partitions of k into equal parts multiplied by the number of ones in the j-th section of the set of partitions of n, where j = (n - k + 1).
For another version see A245095. - Omar E. Pol, Jul 15 2014

			For n = 6:
  -------------------------
  k   A000005        T(6,k)
  1      1  *  7   =    7
  2      2  *  5   =   10
  3      2  *  3   =    6
  4      3  *  2   =    6
  5      2  *  1   =    2
  6      4  *  1   =    4
  .         A000041
  -------------------------
So row 6 is [7, 10, 6, 6, 4, 2]. Note that the sum of row 6 is 7+10+6+6+2+4 = 35 equals A006128(6).
.
Triangle begins:
  1;
  1,   2;
  2,   2,  2;
  3,   4,  2,  3;
  5,   6,  4,  3,  2;
  7,  10,  6,  6,  2,  4;
  11, 14, 10,  9,  4,  4,  2;
  15, 22, 14, 15,  6,  8,  2,  4;
  22, 30, 22, 21, 10, 12,  4,  4,  3;
  30, 44, 30, 33, 14, 20,  6,  8,  3,  4;
  42, 60, 44, 45, 22, 28, 10, 12,  6,  4,  2;
  56, 84, 60, 66, 30, 44, 14, 20,  9,  8,  2,  6;
  ...

Paolo Xausa, Table of n, a(n) for n = 1..11325 (rows 1..150 of the triangle, flattened)

Similar to A221529.
Columns 1-2: A000041, A139582. Leading diagonals 1-3: A000005, A000005, A062011. Row sums give A006128.
Cf. A027293, A135010, A138137, A182703, A245095, A245099.

A221530row[n_]:=DivisorSigma[0,Range[n]]PartitionsP[n-Range[n]];Array[A221530row,10] (* Paolo Xausa, Sep 04 2023 *)

row(n) = vector(n, i, numdiv(i)*numbpart(n-i)); \\ Michel Marcus, Jul 18 2014

T(n,k) = d(k)*p(n-k) = A000005(k)*A027293(n,k).

A339106 Triangle read by rows: T(n,k) = A000203(n-k+1)*A000041(k-1), n >= 1, 1 <= k <= n.

Original entry on oeis.org

1, 3, 1, 4, 3, 2, 7, 4, 6, 3, 6, 7, 8, 9, 5, 12, 6, 14, 12, 15, 7, 8, 12, 12, 21, 20, 21, 11, 15, 8, 24, 18, 35, 28, 33, 15, 13, 15, 16, 36, 30, 49, 44, 45, 22, 18, 13, 30, 24, 60, 42, 77, 60, 66, 30, 12, 18, 26, 45, 40, 84, 66, 105, 88, 90, 42, 28, 12, 36, 39, 75, 56, 132, 90, 154, 120, 126, 56

Offset: 1

Omar E. Pol, Nov 23 2020

Conjecture 1: T(n,k) is the sum of all divisors of all (n - k + 1)'s in the n-th row of triangle A176206, assuming that A176206 has offset 1. The same for the triangle A340061.

Conjecture 2: the sum of row n equals A066186(n), the sum of all parts of all partitions of n.

			Triangle begins:
   1;
   3,  1;
   4,  3,  2;
   7,  4,  6,  3;
   6,  7,  8,  9,  5;
  12,  6, 14, 12, 15,  7;
   8, 12, 12, 21, 20, 21,  11;
  15,  8, 24, 18, 35, 28,  33,  15;
  13, 15, 16, 36, 30, 49,  44,  45,  22;
  18, 13, 30, 24, 60, 42,  77,  60,  66,  30;
  12, 18, 26, 45, 40, 84,  66, 105,  88,  90,  42;
  28, 12, 36, 39, 75, 56, 132,  90, 154, 120, 126, 56;
...
For n = 6 the calculation of every term of row 6 is as follows:
-------------------------
k   A000041        T(6,k)
1      1  *  12  =   12
2      1  *  6   =    6
3      2  *  7   =   14
4      3  *  4   =   12
5      5  *  3   =   15
6      7  *  1   =    7
.         A000203
-------------------------
The sum of row 6 is 12 + 6 + 14 + 12 + 15 + 7 = 66, equaling A066186(6).

Mirror of A221529.
Row sums give A066186 (conjectured).
Main diagonal gives A000041.
Columns 1 and 2 give A000203.
Column 3 gives A074400.
Column 4 gives A272027.
Column 5 gives A274535.
Column 6 gives A319527.
Cf. A176206, A340061.

T[n_, k_] := DivisorSigma[1, n - k + 1] * PartitionsP[k - 1]; Table[T[n, k], {n, 1, 12}, {k, 1, n}] // Flatten (* Amiram Eldar, Jan 08 2021 *)

T(n, k) = sigma(n-k+1)*numbpart(k-1); \\ Michel Marcus, Jan 08 2021

T(n,k) = sigma(n-k+1)*p(k-1), n >= 1, 1 <= k <= n.

A337209 Triangle read by rows T(n,k), (n >= 1, k > = 1), in which row n has length A000070(n-1) and every column gives A000203, the sum of divisors function.

Original entry on oeis.org

1, 3, 1, 4, 3, 1, 1, 7, 4, 3, 3, 1, 1, 1, 6, 7, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 12, 6, 7, 7, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 8, 12, 6, 6, 7, 7, 7, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 15, 8, 12, 12, 6, 6, 6, 7, 7, 7, 7, 7, 4, 4, 4, 4, 4, 4, 4

Offset: 1

Omar E. Pol, Nov 27 2020

Conjecture: the sum of row n equals A066186(n), the sum of all parts of all partitions of n.

			Triangle begins:
   1;
   3,  1;
   4,  3, 1, 1;
   7,  4, 3, 3, 1, 1, 1;
   6,  7, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1;
  12,  6, 7, 7, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1;
   8, 12, 6, 6, 7, 7, 7, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, ...
  ...

Paolo Xausa, Table of n, a(n) for n = 1..10980 (rows 1..21 of the triangle, flattened)

Sum of divisors of terms of A176206.
Cf. A339278 (another version).
Cf. A000070, A000203, A066186, A221529, A238442, A339258.

A337209row[n_]:=Flatten[Table[ConstantArray[DivisorSigma[1,n-m],PartitionsP[m]],{m,0,n-1}]];Array[A337209row,10] (* Paolo Xausa, Sep 02 2023 *)

f(n) = sum(k=0, n-1, numbpart(k));
T(n, k) = {if (k > f(n), error("invalid k")); if (k==1, return (sigma(n))); my(s=0); while (k <= f(n-1), s++; n--;); sigma(1+s);}
tabf(nn) = {for (n=1, nn, for (k=1, f(n), print1(T(n,k), ", ");); );} \\ Michel Marcus, Jan 13 2021

T(n,k) = A000203(A176206(n,k)).

A245095 Triangle read by rows: T(n,k) = A006218(k)*A002865(n-k).

Original entry on oeis.org

1, 0, 3, 1, 0, 5, 1, 3, 0, 8, 2, 3, 5, 0, 10, 2, 6, 5, 8, 0, 14, 4, 6, 10, 8, 10, 0, 16, 4, 12, 10, 16, 10, 14, 0, 20, 7, 12, 20, 16, 20, 14, 16, 0, 23, 8, 21, 20, 32, 20, 28, 16, 20, 0, 27, 12, 24, 35, 32, 40, 28, 32, 20, 23, 0, 29, 14, 36, 40, 56, 40, 56, 32, 40, 23, 27, 0, 35

Offset: 1

Omar E. Pol, Jul 14 2014

Row sums give A006128, n >= 1.
Column 1 is A002865.
Leading diagonal is A006218, n >= 1.
For another version see A221530.

			Triangle begins:
  1;
  0,   3;
  1,   0,  5;
  1,   3,  0,  8;
  2,   3,  5,  0, 10;
  2,   6,  5,  8,  0, 14;
  4,   6, 10,  8, 10,  0, 16;
  4,  12, 10, 16, 10, 14,  0, 20;
  7,  12, 20, 16, 20, 14, 16,  0, 23;
  8,  21, 20, 32, 20, 28, 16, 20,  0, 27;
  12, 24, 35, 32, 40, 28, 32, 20, 23,  0, 29;
  14, 36, 40, 56, 40, 56, 32, 40, 23, 27,  0, 35;
  ...
For n = 6:
  -------------------------
  k   A006218        T(6,k)
  -------------------------
  1      1  *  2   =    2
  2      3  *  2   =    6
  3      5  *  1   =    5
  4      8  *  1   =    8
  5     10  *  0   =    0
  6     14  *  1   =   14
  .         A002865
  -------------------------
So row 6 is [2, 6, 5, 8, 0, 14] and the sum of row 6 is 2+6+5+8+0+14 = 35 equaling A006128(6) = 35.

Paolo Xausa, Table of n, a(n) for n = 1..11325 (rows 1..150 of the triangle, flattened)

Cf. A000005, A000041, A002865, A006128, A006218, A221529, A221530, A245099.

A245095row[n_]:=Accumulate[DivisorSigma[0,Range[n]]]Reverse[Differences[PartitionsP[Range[-1,n-1]]]];Array[A245095row,10] (* Paolo Xausa, Sep 04 2023 *)

a006218(n) = sum(k=1, n, n\k);
a002865(n) = if(n, numbpart(n)-numbpart(n-1), 1);
row(n) = vector(n, i, a006218(i)*a002865(n-i)); \\ Michel Marcus, Jul 18 2014

A302246 Irregular triangle read by rows in which row n lists all parts of all partitions of n, in nonincreasing order.

Original entry on oeis.org

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

Offset: 1

Omar E. Pol, Apr 05 2018

Also due to the correspondence divisor/part row n lists the terms of the n-th row of A338156 in nonincreasing order. In other words: row n lists in nonincreasing order the divisors of the terms of the n-th row of A176206. - Omar E. Pol, Jun 16 2022

			Triangle begins:
  1;
  2,1,1;
  3,2,1,1,1,1;
  4,3,2,2,2,1,1,1,1,1,1,1;
  5,4,3,3,2,2,2,2,1,1,1,1,1,1,1,1,1,1,1,1;
  6,5,4,4,3,3,3,3,2,2,2,2,2,2,2,2,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1;
  ...
For n = 4 the partitions of 4 are [4], [2, 2], [3, 1], [2, 1, 1], [1, 1, 1, 1]. There is only one 4, only one 3, three 2's and seven 1's, so the 4th row of this triangle is [4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1].
On the other hand for n = 4 the 4th row of A176206 is [4, 3, 2, 2, 1, 1, 1] and the divisors of these terms are [1, 2, 4], [1, 3], [1, 2], [1, 2], [1], [1], [1] the same as the 4th row of A338156. These divisors listed in nonincreasing order give the 4th row of this triangle. - _Omar E. Pol_, Jun 16 2022

Paolo Xausa, Table of n, a(n) for n = 1..9687, (rows 1..18 of triangle, flattened).

Both column 1 and 2 are A000027.
Row n has length A006128(n).
The sum of row n is A066186(n).
The number of parts k in row n is A066633(n,k).
The sum of all parts k in row n is A138785(n,k).
The number of parts >= k in row n is A181187(n,k).
The sum of all parts >= k in row n is A206561(n,k).
The number of parts <= k in row n is A210947(n,k).
The sum of all parts <= k in row n is A210948(n,k).
First differs from A036037, A080577, A181317, A237982 and A239512 at a(13) = T(4,3).
Cf. A302247 (mirror).
Cf. A000041, A027550, A176206, A221529, A336812, A338156.

nrows=10;Array[ReverseSort[Flatten[IntegerPartitions[#]]]&,nrows] (* Paolo Xausa, Jun 16 2022 *)

row(n) = my(list = List()); forpart(p=n, for (k=1, #p, listput(list, p[k]));); vecsort(Vec(list), , 4); \\ Michel Marcus, Jun 16 2022

A302247 Irregular triangle read by rows in which row n lists all parts of all partitions of n, in nondecreasing order.

Original entry on oeis.org

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

Offset: 1

Omar E. Pol, Apr 05 2018

Also due to the correspondence divisor/part row n lists the terms of the n-th row of A338156 in nondecreasing order. In other words: row n lists in nondecreasing order the divisors of the terms of the n-th row of A176206. - Omar E. Pol, Jun 16 2022

			Triangle begins:
  1;
  1,1,2;
  1,1,1,1,2,3;
  1,1,1,1,1,1,1,2,2,2,3,4;
  1,1,1,1,1,1,1,1,1,1,1,1,2,2,2,2,3,3,4,5;
  1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,2,2,2,2,2,2,2,2,3,3,3,3,4,4,5,6;
  ...
For n = 4 the partitions of 4 are [4], [2, 2], [3, 1], [2, 1, 1], [1, 1, 1, 1]. There are seven 1's, three 2's, only one 3 and only one 4, so the 4th row of this triangle is [1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 3, 4].
On the other hand for n = 4 the 4th row of A176206 is [4, 3, 2, 2, 1, 1, 1] and the divisors of these terms are [1, 2, 4], [1, 3], [1, 2], [1, 2], [1], [1], [1] the same as the 4th row of A338156. These divisors listed in nondecreasing order give the 4th row of this triangle. - _Omar E. Pol_, Jun 16 2022

Paolo Xausa, Table of n, a(n) for n = 1..9687, (rows 1..18 of triangle, flattened)

Mirror of A302246.
Row n has length A006128(n).
The sum of row n is A066186(n).
The number of parts k in row n is A066633(n,k).
The sum of all parts k in row n is A138785(n,k).
The number of parts >= k in row n is A181187(n,k).
The sum of all parts >= k in row n is A206561(n,k).
The number of parts <= k in row n is A210947(n,k).
The sum of all parts <= k in row n is A210948(n,k).
First differs from both A026791 and A080576 at a(17) = T(4,7).
Cf. A000041, A027750, A176206, A221529, A336812, A338156.

nrows=10; Array[Sort[Flatten[IntegerPartitions[#]]]&,nrows] (* Paolo Xausa, Jun 16 2022 *)

row(n) = my(list = List()); forpart(p=n, for (k=1, #p, listput(list, p[k]));); vecsort(Vec(list)); \\ Michel Marcus, Jun 16 2022

cp's OEIS Frontend

A338156 Irregular triangle read by rows in which row n lists n blocks, where the m-th block consists of A000041(m-1) copies of the divisors of (n - m + 1), with 1 <= m <= n.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

A336812 Irregular triangle read by rows T(n,k), n >= 1, k >= 1, in which row n is constructed replacing every term of row n of A336811 with its divisors.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

A340035 Irregular triangle read by rows T(n,k) in which row n lists n blocks, where the m-th block consists of A000041(n-m) copies of the divisors of m, with 1 <= m <= n.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

A339278 Irregular triangle read by rows T(n,k), (n >= 1, k >= 1), in which the partition number A000041(n-1) is the length of row n and every column k is A000203, the sum of divisors function.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

PARI

Formula

A221530 Triangle read by rows: T(n,k) = A000005(k)*A000041(n-k).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A339106 Triangle read by rows: T(n,k) = A000203(n-k+1)*A000041(k-1), n >= 1, 1 <= k <= n.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

PARI

Formula

A337209 Triangle read by rows T(n,k), (n >= 1, k > = 1), in which row n has length A000070(n-1) and every column gives A000203, the sum of divisors function.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Formula