A127093 -id:A127093 - cp's OEIS frontend

A285914 Irregular triangle read by rows: T(n,k), n>=1, k>=1, in which column k lists k's interleaved with k-1 zeros, and the first element of column k is in row k(k+1)/2.

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

Offset: 1

Omar E. Pol, Apr 28 2017

Conjecture 1: T(n,k) is the number of parts in the partition of n into k consecutive parts, if T(n,k) > 0.
Conjecture 2: row sums give A204217, which should be also the total number of parts in all partitions of n into consecutive parts.
(The conjectures are true. See Joerg Arndt's proof in the Links section.) - Omar E. Pol, Jun 14 2017
From Omar E. Pol, May 05 2020: (Start)
Theorem: Let T(n,k) be an irregular triangle read by rows in which column k lists k's interleaved with k-1 zeros, and the first element of column k is in the row that is the k-th (m+2)-gonal number, with n >= 1, k >= 1, m >= 0. T(n,k) is also the number of parts in the partition of n into k consecutive parts that differ by m, including n as a valid partition. Hence the sum of row n gives the total number of parts in all partitions of n into consecutive parts that differ by m.
About the above theorem, this is the case for m = 1. For m = 0 see the triangle A127093, in which row sums give A000203. For m = 2 see the triangle A330466, in which row sums give A066839 (conjectured). For m = 3 see the triangle A330888, in which row sums give A330889.
Note that there are infinitely many triangles of this kind, with m >= 0. Also, every triangle can be represented with a diagram of overlapping curves, in which every column of triangle is represented by a periodic curve. (End)

			Triangle begins (rows 1..28):
1;
1;
1,  2;
1,  0;
1,  2;
1,  0,  3;
1,  2,  0;
1,  0,  0;
1,  2,  3;
1,  0,  0,  4;
1,  2,  0,  0;
1,  0,  3,  0;
1,  2,  0,  0;
1,  0,  0,  4;
1,  2,  3,  0,  5;
1,  0,  0,  0,  0;
1,  2,  0,  0,  0;
1,  0,  3,  4,  0;
1,  2,  0,  0,  0;
1,  0,  0,  0,  5;
1,  2,  3,  0,  0,  6;
1,  0,  0,  4,  0,  0;
1,  2,  0,  0,  0,  0;
1,  0,  3,  0,  0,  0;
1,  2,  0,  0,  5,  0;
1,  0,  0,  4,  0,  0;
1,  2,  3,  0,  0,  6;
1,  0,  0,  0,  0,  0,  7;
...
In accordance with the conjectures, for n = 15 there are four partitions of 15 into consecutive parts: [15], [8, 7], [6, 5, 4] and [5, 4, 3, 2, 1]. These partitions are formed by 1, 2, 3 and 5 consecutive parts respectively, so the 15th row of the triangle is [1, 2, 3, 0, 5].
Illustration of initial terms:
Row                                                         _
1                                                         _|1|
2                                                       _|1 _|
3                                                     _|1  |2|
4                                                   _|1   _|0|
5                                                 _|1    |2 _|
6                                               _|1     _|0|3|
7                                             _|1      |2  |0|
8                                           _|1       _|0 _|0|
9                                         _|1        |2  |3 _|
10                                      _|1         _|0  |0|4|
11                                    _|1          |2   _|0|0|
12                                  _|1           _|0  |3  |0|
13                                _|1            |2    |0 _|0|
14                              _|1             _|0   _|0|4 _|
15                            _|1              |2    |3  |0|5|
16                          _|1               _|0    |0  |0|0|
17                        _|1                |2     _|0 _|0|0|
18                      _|1                 _|0    |3  |4  |0|
19                    _|1                  |2      |0  |0 _|0|
20                  _|1                   _|0     _|0  |0|5 _|
21                _|1                    |2      |3   _|0|0|6|
22              _|1                     _|0      |0  |4  |0|0|
23            _|1                      |2       _|0  |0  |0|0|
24          _|1                       _|0      |3    |0 _|0|0|
25        _|1                        |2        |0   _|0|5  |0|
26      _|1                         _|0       _|0  |4  |0 _|0|
27    _|1                          |2        |3    |0  |0|6 _|
28   |1                            |0        |0    |0  |0|0|7|
...
Note that the k's are placed exactly below the k-th horizontal line segment of every row.
The above structure is related to the triangle A237591, also to the left-hand part of the triangle A237593, and also to the left-hand part of the front view of the pyramid described in A245092.

Joerg Arndt, Proof of the conjectures of A204217 and A285914, SeqFan Mailing Lists, Jun 03 2017.

Row n has length A003056(n).
Column k starts in row A000217(k).
The number of positive terms in row n is A001227(n), the number of partitions of n into consecutive parts.
Cf. A000203, A066839, A196020, A204217, A235791, A236104, A237048, A237591, A237593, A245092, A261699, A285898, A262626, A330889.
Triangles of the same family are A127093, this sequence, A330466, A330888.

With[{nn = 6}, Table[Boole[If[EvenQ@ k, Mod[(n - k/2), k] == 0, Mod[n, k] == 0]] k, {n, nn (nn + 3)/2}, {k, Floor[((Sqrt[8 n + 1] - 1)/2)]}]] // Flatten (* Michael De Vlieger, Jun 15 2017, after Python by Indranil Ghosh *)

t(n, k) = if (k % 2, (n % k) == 0, ((n - k/2) % k) == 0); \\ A237048
tabf(nn) = {for (n=1, nn, for (k=1, floor((sqrt(1+8*n)-1)/2), print1(k*t(n, k), ", "); ); print(); ); } \\ Michel Marcus, Nov 04 2019

from sympy import sqrt
import math
def a237048(n, k):
    return int(n%k == 0) if k%2 else int(((n - k//2)%k) == 0)
def T(n, k): return k*a237048(n, k)
for n in range(1, 29): print([T(n, k) for k in range(1, int(math.floor((sqrt(8*n + 1) - 1)/2)) + 1)]) # Indranil Ghosh, Apr 30 2017

T(n,k) = k*A237048(n,k).

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 *)

A054535 Square array giving Ramanujan sum T(n,k) = c_n(k) = Sum_{m=1..n, (m,n)=1} exp(2 Pi i m k / n), read by antidiagonals upwards (n >= 1, k >= 1).

Original entry on oeis.org

1, -1, 1, -1, 1, 1, 0, -1, -1, 1, -1, -2, 2, 1, 1, 1, -1, 0, -1, -1, 1, -1, -1, -1, 2, -1, 1, 1, 0, -1, -2, -1, 0, 2, -1, 1, 0, 0, -1, -1, 4, -2, -1, 1, 1, 1, 0, 0, -1, 1, -1, 0, -1, -1, 1, -1, -1, -3, -4, -1, 2, -1, 2, 2, 1, 1, 0, -1, 1, 0, 0, -1, 1, -1, 0, -1, -1, 1, -1, 2, -1, -1, 0, 0, 6, -1, -1, -2, -1, 1, 1, 1, -1

Offset: 1

N. J. A. Sloane, Apr 09 2000

Replace the first column in A077049 with any k-th column in A177121 to get a new array. Then the matrix inverse of the new array will have the k-th column of A054535 (this array) as its first column. - Mats Granvik, May 03 2010
We have T(n, k) = c_n(k) = Sum_{m=1..n, (m,n)=1} exp(2 Pi i m k / n) and
A054534(n, k) = c_k(n) = Sum_{m=1..k, (m,k)=1} exp(2 Pi i m n / k). That is, the current array is the transpose of array A054534. Dirichlet g.f.'s for these two arrays are given below by R. J. Mathar and  Mats Granvik. - Petros Hadjicostas, Jul 27 2019

			Square array T(n,k) = c_n(k) (with rows n >= 1 and columns k >= 1) starts as follows:
   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, -1,  2, -1, -1,  2, -1, -1,  2, -1, -1,  2, -1, ...
   0, -2,  0,  2,  0, -2,  0,  2,  0, -2,  0,  2,  0, ...
  -1, -1, -1, -1,  4, -1, -1, -1, -1,  4, -1, -1, -1, ...
   1, -1, -2, -1,  1,  2,  1, -1, -2, -1,  1,  2,  1, ...
  -1, -1, -1, -1, -1, -1,  6, -1, -1, -1, -1, -1, -1, ...
   0,  0,  0, -4,  0,  0,  0,  4,  0,  0,  0, -4,  0, ...
   ... [example edited by _Petros Hadjicostas_, Jul 27 2019]

T. M. Apostol, Introduction to Analytic Number Theory, Springer-Verlag, page 160.
G. H. Hardy and E. M. Wright, An Introduction to the Theory of Numbers. Fifth ed., Oxford Science Publications, Clarendon Press, Oxford, 2003.
E. C. Titchmarsh and D. R. Heath-Brown, The theory of the Riemann zeta-function, 2nd ed., 1986.

Robert Israel, Table of n, a(n) for n = 1..10011 (T(n,k) for n+k <= 142).
Tom M. Apostol, Arithmetical properties of generalized Ramanujan sums, Pacific J. Math. 41 (1972), 281-293.
Eckford Cohen, A class of arithmetic functions, Proc. Natl. Acad. Sci. USA 41 (1955), 939-944.
A. Elashvili, M. Jibladze, and D. Pataraia, Combinatorics of necklaces and "Hermite reciprocity", J. Algebraic Combin. 10 (1999), 173-188.
M. L. Fredman, A symmetry relationship for a class of partitions, J. Combinatorial Theory Ser. A 18 (1975), 199-202.
Emiliano Gagliardo, Le funzioni simmetriche semplici delle radici n-esime primitive dell'unità, Bollettino dell'Unione Matematica Italiana Serie 3, 8(3) (1953), 269-273.
Otto Hölder, Zur Theorie der Kreisteilungsgleichung K_m(x)=0, Prace mat.-fiz. 43 (1936), 13-23.
Peter H. van der Kamp, On the Fourier transform of the greatest common divisor, Integers 13 (2013), #A24. [See Section 3 for historical remarks.]
J. C. Kluyver, Some formulae concerning the integers less than n and prime to n, in: KNAW, Proceedings, 9 I, 1906, Amsterdam, 1906, pp. 408-414; see p. 410.
C. A. Nicol, On restricted partitions and a generalization of the Euler phi number and the Moebius function, Proc. Natl. Acad. Sci. USA 39(9) (1953), 963-968.
C. A. Nicol and H. S. Vandiver, A von Sterneck arithmetical function and restricted partitions with respect to a modulus, Proc. Natl. Acad. Sci. USA 40(9) (1954), 825-835.
K. G. Ramanathan, Some applications of Ramanujan's trigonometrical sum C_m(n), Proc. Indian Acad. Sci., Sect. A 20 (1944), 62-69.
Srinivasa Ramanujan, On certain trigonometric sums and their applications in the theory of numbers, Trans. Camb. Phil. Soc. 22 (1918), 259-276.
R. D. von Sterneck, Ein Analogon zur additiven Zahlentheorie, Sitzungsber. Akad. Wiss. Sapientiae Math.-Naturwiss. Kl. 111 (1902), 1567-1601 (Abt. IIa). [It may not be universally accessible.]
R. D. von Sterneck, Über ein Analogon zur additiven Zahlentheorie, Jahresbericht der Deutschen Mathematiker-Vereinigung 12 (1903), 110-113. [Summary of the 1902 paper.]
Wikipedia, Ramanujan's sum.
Wikipedia, Robert Daublebsky von Sterneck der Jüngere.
Aurel Wintner, On a statistics of the Ramanujan sums, Amer. J. Math., 64(1) (1942), 106-114.

Transpose of array in A054534. Cf. A054532, A054533, A282634.

Cf. A086831=c_n(2) (2nd column), A085097=c_n(3) (3rd column), A085384=c_n(4) (4th column), A085639=c_n(5) (fifth column), A085906=c_n(6) (sixth column), A099837=c_3(n) (third row), A176742=c_4(n) (fourth row), A100051=c_6(n) (sixth row).

with(numtheory): c:=(n,k)->phi(n)*mobius(n/gcd(n,k))/phi(n/gcd(n,k)): for n from 1 to 13 do seq(c(n+1-j,j),j=1..n) od; # gives the sequence in triangular form # Emeric Deutsch
# to get the example above
for n to 8 do
    seq(c(n, k), k = 1 .. 13);
end do
# Petros Hadjicostas, Jul 27 2019

nmax = 14; t[n_, k_] := EulerPhi[n]*(MoebiusMu[n / GCD[n, k]] / EulerPhi[n / GCD[n, k]]); Flatten[ Table[t[n - k + 1, k], {n, 1, nmax}, {k, 1, n}]] (* Jean-François Alcover, Nov 10 2011, after Emeric Deutsch *)
(* To get the example above in table format *)
TableForm[Table[t[n, k], {n, 1, 8}, {k, 1, 13}]]
(* Petros Hadjicostas, Jul 27 2019 *)

T(n,k) = c_n(k) = phi(n) * Moebius(n/gcd(n, k))/phi(n/gcd(n, k)). - Emeric Deutsch, Dec 23 2004 [The r.h.s. of this formula is known as the von Sterneck function, and it was introduced by him around 1900. - Petros Hadjicostas, Jul 20 2019]
Dirichlet series: Sum_{n>=1} c_n(k)/n^s = sigma_{1-s}(k)/zeta(s) where sigma is the sum-of-divisors function. Sum_{n>=1} c_k(n)/n^s = zeta(s)*Sum_{d|k} mu(k/d)*d^(1-s). [Hardy & Wright, Titchmarsh] - R. J. Mathar, Apr 01 2012 [We have sigma_{1-s}(k) = Sum_{d|k} d^{1-s} = Sum_{d|k} (k/d)^{1-s} = sigma_{s-1}(k) / k^{s-1}. - Petros Hadjicostas, Jul 27 2019]
From Mats Granvik, Oct 10 2016: (Start)
For n >= 1 and k >= 1 let
A(n,k) := if n mod k = 0 then k^r, otherwise 0;
B(n,k) := if n mod k = 0 then k/n^s, otherwise 0.
Then the Ramanujan's sum matrix equals
inverse(A).transpose(B) evaluated at s=0 and r=0.
Equals inverse(A051731).transpose(A127093).
Dirichlet g.f.: Sum_{n>=1} Sum_{k>=1} T(n,k)/(n^r*k^s) = zeta(s)*zeta(s + r - 1)/zeta(r) as in Wikipedia. (End)
T(n,k) = c_n(k) = Sum_{s | gcd(n,k)} s * Moebius(n/s). - Petros Hadjicostas, Jul 27 2019
Lambert series and a consequence: Sum_{n >= 1} c_n(k) * z^n / (1 - z^n) = Sum_{s|k} s * z^s and -Sum_{n >= 1} (c_n(k) / n) * log(1 - z^n) = Sum_{s|k} z^s for |z| < 1 (using the principal value of the logarithm). - Petros Hadjicostas, Aug 15 2019

Name edited by Petros Hadjicostas, Jul 27 2019

A221649 Tetrahedron E(n,j,k) = kT(j,k)p(n-j), where T(j,k) = 1 if k divides j otherwise 0.

Original entry on oeis.org

1, 1, 1, 2, 2, 1, 2, 1, 0, 3, 3, 2, 4, 1, 0, 3, 1, 2, 0, 4, 5, 3, 6, 2, 0, 6, 1, 2, 0, 4, 1, 0, 0, 0, 5, 7, 5, 10, 3, 0, 9, 2, 4, 0, 8, 1, 0, 0, 0, 5, 1, 2, 3, 0, 0, 6, 11, 7, 14, 5, 0, 15, 3, 6, 0, 12, 2, 0, 0, 0, 10, 1, 2, 3, 0, 0, 6, 1, 0, 0, 0, 0, 0, 7

Offset: 1

Omar E. Pol, Jan 21 2013

The tetrahedron shows a connection between divisors and partitions.
The sum of all elements of slice n is A066186(n).
The sum of row j of slice n is A221529(n,j).
The sum of column k of slice n is A138785(n,k), the sum of all parts of size k in all partitions of n.
See also the tetrahedron of A221650.

			First five slices of tetrahedron are
---------------------------------------------------
n  j / k   1  2  3  4  5  6      A221529   A066186
---------------------------------------------------
1  1       1,                       1         1
...................................................
2  1       1,                       1
2  2       1, 2,                    3         4
...................................................
3  1       2,                       2
3  2       1, 2,                    3
3  3       1, 0, 3,                 4         9
...................................................
4  1       3,                       3
4  2       2, 4,                    6
4  3       1, 0, 3,                 4
4  4       1, 2, 0, 4,              7        20
...................................................
5  1       5,                       5
5  2       3, 6,                    9
5, 3,      2, 0, 6,                 8
5, 4,      1, 2, 0, 4,              7
5, 5,      1, 0, 0, 0, 5,           6        35
...................................................
.
From _Omar E. Pol_, Jul 26 2021: (Start)
The slices of the tetrahedron appear in the upper zone of the following table (formed by four zones) which shows the correspondence between divisors and parts (n = 1..5):
.
|---|---------|-----|-------|---------|-----------|-------------|
| n |         |  1  |   2   |    3    |     4     |      5      |
|---|---------|-----|-------|---------|-----------|-------------|
|   |    -    |     |       |         |           |  5          |
| C |    -    |     |       |         |  3        |  3 6        |
| O |    -    |     |       |  2      |  2 4      |  2 0 6      |
| N | A127093 |     |  1    |  1 2    |  1 0 3    |  1 2 0 4    |
| D | A127093 |  1  |  1 2  |  1 0 3  |  1 2 0 4  |  1 0 0 0 5  |
|---|---------|-----|-------|---------|-----------|-------------|
.
|---|---------|-----|-------|---------|-----------|-------------|
|   | A127093 |     |       |         |           |  1          |
|   | A127093 |     |       |         |           |  1          |
|   | A127093 |     |       |         |           |  1          |
|   | A127093 |     |       |         |           |  1          |
| D | A127093 |     |       |         |           |  1          |
| I |---------|-----|-------|---------|-----------|-------------|
| V | A127093 |     |       |         |  1        |  1 2        |
| I | A127093 |     |       |         |  1        |  1 2        |
| S | A127093 |     |       |         |  1        |  1 2        |
| O |---------|-----|-------|---------|-----------|-------------|
| R | A127093 |     |       |  1      |  1 2      |  1 0 3      |
| S | A127093 |     |       |  1      |  1 2      |  1 0 3      |
|   |---------|-----|-------|---------|-----------|-------------|
|   | A127093 |     |  1    |  1 2    |  1 0 3    |  1 2 0 4    |
|   |---------|-----|-------|---------|-----------|-------------|
|   | A127093 |  1  |  1 2  |  1 0 3  |  1 2 0 4  |  1 0 0 0 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 upper zone is a condensed version of the "divisors" zone.
The above table is the table of A340011 upside down.
For more information about the correspondence divisor/part see A338156. (End)

Paolo Xausa, Table of n, a(n) for n = 1..11480 (rows n = 1..40 of the tetrahedron, flattened)

Nonzero terms give A340057.

Cf. A000005, A000041, A000203, A027750, A051731, A066186, A127093, A138785, A221529, A221650, A237593, A336811, A336812, A338156, A340011, A340031, A340032, A340035, A340056.

A221649row[n_]:=Flatten[Table[If[Divisible[j,k],PartitionsP[n-j]k,0],{j,n},{k,j}]];Array[A221649row,10] (* Paolo Xausa, Sep 26 2023 *)

E(n,j,k) = k*A051731(j,k)*A000041(n-j) = A127093(j,k)*A000041(n-j) = k*A221650(n,j,k).

a(18)-a(19) and a(28)-a(29) corrected by Paolo Xausa, Sep 26 2023

A147861 Triangle read by rows: T(n,k)=min(k, n/k) if k divides n, T(n,k)=0 otherwise (n >=1, 1<=k<=n).

Original entry on oeis.org

1, 1, 1, 1, 0, 1, 1, 2, 0, 1, 1, 0, 0, 0, 1, 1, 2, 2, 0, 0, 1, 1, 0, 0, 0, 0, 0, 1, 1, 2, 0, 2, 0, 0, 0, 1, 1, 0, 3, 0, 0, 0, 0, 0, 1, 1, 2, 0, 0, 2, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 2, 3, 3, 0, 2, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1

Offset: 1

Omar E. Pol, Nov 16 2008, Jul 20 2009

			Triangle begins:
1;
1,1;
1,0,1;
1,2,0,1;
1,0,0,0,1;
1,2,2,0,0,1;
1,0,0,0,0,0,1;
1,2,0,2,0,0,0,1;
1,0,3,0,0,0,0,0,1;
1,2,0,0,2,0,0,0,0,1;
1,0,0,0,0,0,0,0,0,0,1;
1,2,3,3,0,2,0,0,0,0,0,1;
1,0,0,0,0,0,0,0,0,0,0,0,1;
1,2,0,0,0,0,2,0,0,0,0,0,0,1;
1,0,3,0,3,0,0,0,0,0,0,0,0,0,1;
1,2,0,4,0,0,0,2,0,0,0,0,0,0,0,1;
1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1;
1,2,3,0,0,3,0,0,2,0,0,0,0,0,0,0,0,1;
1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1;
1,2,0,4,4,0,0,0,0,2,0,0,0,0,0,0,0,0,0,1;
1,0,3,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,1;
1,2,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,1;
1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1;
1,2,3,4,0,4,0,3,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,1;
1,0,0,0,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1;
1,2,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,1;
1,0,3,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1;
1,2,0,4,0,0,4,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,1;
1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1;
1,2,3,0,5,5,0,0,0,3,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1;
...
Row sums: A117004.

Omar E. Pol, Determinacion geometrica de los numeros primos y perfectos [From _Omar E. Pol_, Jul 20 2009]
Omar E. Pol, Illustration: Divisors and pi(x) [From _Omar E. Pol_, Jul 20 2009]

Cf. A000005, A008578, A027750, A051731, A117004, A127093, A161345, A161424, A161835, A162526, A162527, A162528, A162529, A162530, A162531, A162532. [From Omar E. Pol, Jul 20 2009]

Submitted without a definition, which was supplied by Jon E. Schoenfield, Dec 13 2008

A221650 Tetrahedron P(n,j,k) = T(j,k)*p(n-j), where T(j,k) = 1 if k divides j otherwise 0.

Original entry on oeis.org

1, 1, 1, 1, 2, 1, 1, 1, 0, 1, 3, 2, 2, 1, 0, 1, 1, 1, 0, 1, 5, 3, 3, 2, 0, 2, 1, 1, 0, 1, 1, 0, 0, 0, 1, 7, 5, 5, 3, 0, 3, 2, 2, 0, 2, 1, 0, 0, 0, 1, 1, 1, 1, 0, 0, 1, 11, 7, 7, 5, 0, 5, 3, 3, 0, 3, 2, 0, 0, 0, 2, 1, 1, 1, 0, 0, 1, 1, 0, 0, 0, 0, 0, 1

Offset: 1

Omar E. Pol, Jan 21 2013

This tetrahedron shows a connection between divisors and partitions.
Conjecture 1: P(n,j,k) is the number of partitions of n that contain at least m parts of size k, where m = j/k, if k divides j otherwise P(n,j,k) = 0.
Conjecture 2: P(n,j,k) is the number of parts that are the m-th part of size k in all partitions of n, where m = j/k, if k divides j otherwise P(n,j,k) = 0.
The sum of all elements of slice n is A006128(n).
The sum of row j of slice n is A221530(n,j).
The sum of column k of slice n is A066633(n,k).
See also the tetrahedron of A221649.

			First six slices of tetrahedron are
---------------------------------------------------
n  j    k: 1  2  3  4  5  6      A221530   A006128
---------------------------------------------------
1  1       1,                       1         1
...................................................
2  1       1,                       1
2  2       1, 1,                    2         3
...................................................
3  1       2,                       2
3  2       1, 1,                    2
3  3       1, 0, 1,                 2         6
...................................................
4  1       3,                       3
4  2       2, 2,                    4
4  3       1, 0, 1,                 2
4  4       1, 1, 0, 1,              3        12
...................................................
5  1       5,                       5
5  2       3, 3,                    6
5  3       2, 0, 2,                 4
5  4       1, 1, 0, 1,              3
5  5       1, 0, 0, 0, 1,           2        20
...................................................
6  1       7,                       7
6  2       5, 5,                   10
6  3       3, 0, 3,                 6
6  4       2, 2, 0, 2,              6
6  5       1, 0, 0, 0, 1,           2
6  6       1, 1, 1, 0, 0, 1         4        35
...................................................

Paolo Xausa, Table of n, a(n) for n = 1..11480 (rows n = 1..40 of the tetrahedron, flattened)

Cf. A000005, A006128, A027750, A051731, A066633, A127093, A221530, A221649.

A221650row[n_]:=Flatten[Table[If[Divisible[j,k],PartitionsP[n-j],0],{j,n},{k,j}]];Array[A221650row,10] (* Paolo Xausa, Sep 26 2023 *)

P(n,j,k) = A051731(j,k)*A000041(n-j) = (1/k)*A221649(n,j,k).

A330888 Irregular triangle read by rows: T(n,k) is the number of parts in the partition of n into k consecutive parts that differ by 3, n >= 1, k >= 1, and the first element of column k is in the row that is the k-th pentagonal number (A000326).

Original entry on oeis.org

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

Offset: 1

Omar E. Pol, Apr 30 2020

Since the trivial partition n is counted, so T(n,1) = 1.

This is an irregular triangle read by rows: T(n,k), n >= 1, k >= 1, in which column k lists k's interleaved with k-1 zeros, and the first element of column k is in the row that is the k-th pentagonal number.

			Triangle begins (rows 1..26):
1;
1;
1;
1;
1, 2;
1, 0;
1, 2;
1, 0;
1, 2;
1, 0;
1, 2;
1, 0, 3;
1, 2, 0;
1, 0, 0;
1, 2, 3;
1, 0, 0;
1, 2, 0;
1, 0, 3;
1, 2, 0;
1, 0, 0;
1, 2, 3;
1, 0, 0, 4;
1, 2, 0, 0;
1, 0, 3, 0;
1, 2, 0, 0;
1, 0, 0, 4;
...
For n = 21 there are three partitions of 21 into consecutive parts that differ by 3, including 21 as a partition. They are [21], [12, 9] and [10, 7, 4]. The number of parts of these partitions are 1, 2 and 3 respectively, so the 21st row of the triangle is [1, 2, 3].

Cf. A000326, A330887.

Other triangles of the same family are A127093, A285914, A330466.

A330888 := proc(n,k)
    k*A330887(n,k) ;
end proc:
for n from 1 to 40 do
    for k from 1 do
        if n>= A000325(k) then
            printf("%d,",A330888(n,k)) ;
        else
            break;
        end if;
    end do:
    printf("\n") ;
end do: # R. J. Mathar, Oct 02 2020

T(n,k) = k*A330887(n,k).

A334466 Square array read by antidiagonals upwards: T(n,k) is the total number of parts in all partitions of n into consecutive parts that differ by k, with n >= 1, k >= 0.

Original entry on oeis.org

1, 3, 1, 4, 1, 1, 7, 3, 1, 1, 6, 1, 1, 1, 1, 12, 3, 3, 1, 1, 1, 8, 4, 1, 1, 1, 1, 1, 15, 3, 3, 3, 1, 1, 1, 1, 13, 1, 1, 1, 1, 1, 1, 1, 1, 18, 6, 3, 3, 3, 1, 1, 1, 1, 1, 12, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 28, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 14, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 24, 3, 6, 3, 3, 3, 3, 1

Offset: 1

Omar E. Pol, May 01 2020

The one-part partition n = n is included in the count.
The column k is related to (k+2)-gonal numbers, assuming that 2-gonals are the nonnegative numbers, 3-gonals are the triangular numbers, 4-gonals are the squares, 5-gonals are the pentagonal numbers, and so on.
Note that the number of parts for T(n,0) = A000203(n), equaling the sum of the divisors of n.
For fixed k>0, Sum_{j=1..n} T(j,k) ~ 2^(3/2) * n^(3/2) / (3*sqrt(k)). - Vaclav Kotesovec, Oct 23 2024

			Square array starts:
   n\k|   0  1  2  3  4  5  6  7  8  9 10 11 12
   ---+---------------------------------------------
   1  |   1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, ...
   2  |   3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, ...
   3  |   4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, ...
   4  |   7, 1, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, ...
   5  |   6, 3, 1, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, ...
   6  |  12, 4, 3, 1, 3, 1, 1, 1, 1, 1, 1, 1, 1, ...
   7  |   8, 3, 1, 3, 1, 3, 1, 1, 1, 1, 1, 1, 1, ...
   8  |  15, 1, 3, 1, 3, 1, 3, 1, 1, 1, 1, 1, 1, ...
   9  |  13, 6, 4, 3, 1, 3, 1, 3, 1, 1, 1, 1, 1, ...
  10  |  18, 5. 3. 1. 3. 1, 3, 1, 3, 1, 1, 1, 1, ...
  11  |  12, 3, 1, 3, 1, 3, 1, 3, 1, 3, 1, 1, 1, ...
  12  |  28, 4, 6, 4, 3, 1, 3, 1, 3, 1, 3, 1, 1, ...
  ...
For n = 9 we have that:
For k = 0 the partitions of 9 into consecutive parts that differ by 0 (or simply: the partitions of 9 into equal parts) are [9], [3,3,3], [1,1,1,1,1,1,1,1,1]. In total there are 13 parts, so T(9,0) = 13.
For k = 1 the partitions of 9 into consecutive parts that differ by 1 (or simply: the partitions of 9 into consecutive parts) are [9], [5,4], [4,3,2]. In total there are six parts, so T(9,1) = 6.
For k = 2 the partitions of 9 into consecutive parts that differ by 2 are [9], [5, 3, 1]. In total there are four parts, so T(9,2) = 4.

Columns k: A000203 (k=0), A204217 (k=1), A066839 (k=2), A330889 (k=3), A334464 (k=4), A334732 (k=5), A334949 (k=6), A377300 (k=7), A377301 (k=8).
Triangles whose row sums give the column k: A127093 (k=0), A285914 (k=1), A330466 (k=2) (conjectured), A330888 (k=3), A334462 (k=4), A334540 (k=5), A339947 (k=6).
Sequences of number of partitions related to column k: A000005 (k=0), A001227 (k=1), A038548 (k=2), A117277 (k=3), A334461 (k=4), A334541 (k=5), A334948 (k=6).
Tables of partitions related to column k: A010766 (k=0), A286001 (k=1), A332266 (k=2), A334945 (k=3), A334618 (k=4).
Polygonal numbers related to column k: A001477 (k=0), A000217 (k=1), A000290 (k=2), A000326 (k=3), A000384 (k=4), A000566 (k=5), A000567 (k=6).
Cf. A051735, A237048, A303300, A330887, A334460, A334465, A334946.
Cf. A038040, A245579, A060872, A334467, A327262, A334733, A334953.
Cf. A057145, A323345.

nmax = 14;
col[k_] := col[k] = CoefficientList[Sum[n x^(n(k n - k + 2)/2)/(1 - x^n), {n, 1, nmax}] + O[x]^(nmax+1), x];
T[n_, k_] := col[k][[n+1]];
Table[T[n-k, k], {n, 1, nmax}, {k, 0, n-1}] // Flatten (* Jean-François Alcover, Nov 30 2020 *)

The g.f. for column k is Sum_{n>=1} n*x^(n*(k*n-k+2)/2)/(1-x^n). (For proof, see A330889. - N. J. A. Sloane, Nov 21 2020)

A163100 Triangle giving positive values of A147861.

Original entry on oeis.org

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

Offset: 1

Omar E. Pol, Jul 20 2009

			Triangle begins:
1;
1,1;
1,..1;
1,2,..1;
1,......1;
1,2,2,....1;
1,..........1;
1,2,..2,......1;
1,..3,..........1;
1,2,....2,........1;
1,..................1;
1,2,3,3,..2,..........1;
1,......................1;
1,2,........2,............1;
1,..3,..3,..................1;
1,2,..4,......2,..............1;
1,..............................1;
1,2,3,....3,....2,................1;
1,..................................1;
1,2,..4,4,........2,..................1;
1,..3,......3,..........................1;
1,2,................2,....................1;
1,..........................................1;
1,2,3,4,..4,..3,......2,......................1;
1,......5,......................................1;
1,2,....................2,........................1;
1,..3,..........3,..................................1;
1,2,..4,....4,............2,..........................1;
1,......................................................1;
1,2,3,..5,5,......3,........2,............................1;
...
Row sums: A117004.

Omar E. Pol, Determinacion geometrica de los numeros primos y perfectos
Omar E. Pol, Illustration: Divisors and pi(x)

Cf. A000005, A008578, A027750, A051731, A117004, A127093, A147861, A161345, A161424, A161835, A162526, A162527, A162528, A162529, A162530, A162531, A162532.

A147861 := proc(n,k) if k<=0 or k > n then 0; else if n mod k = 0 then min(k,n/k) ; else 0; fi; fi; end proc: A163100 := proc(n,k) local dvs; dvs := sort(convert(numtheory[divisors](n),list)) ; min( op(k,dvs),n/op(k,dvs)) ; end: for n from 1 to 60 do for k from 1 to numtheory[tau](n) do printf("%d,",A163100(n,k) ) ; end do; end do: # R. J. Mathar, Aug 01 2009

Extended beyond row 12 by R. J. Mathar, Aug 01 2009

cp's OEIS Frontend

A285914 Irregular triangle read by rows: T(n,k), n>=1, k>=1, in which column k lists k's interleaved with k-1 zeros, and the first element of column k is in row k(k+1)/2.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Python

Formula

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

A054535 Square array giving Ramanujan sum T(n,k) = c_n(k) = Sum_{m=1..n, (m,n)=1} exp(2 Pi i m k / n), read by antidiagonals upwards (n >= 1, k >= 1).

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Maple

Mathematica

Formula

Extensions

A221649 Tetrahedron E(n,j,k) = k*T(j,k)*p(n-j), where T(j,k) = 1 if k divides j otherwise 0.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Formula

Extensions

A147861 Triangle read by rows: T(n,k)=min(k, n/k) if k divides n, T(n,k)=0 otherwise (n >=1, 1<=k<=n).

Views

Author

Keywords

Examples

Links

Crossrefs

Extensions

A221650 Tetrahedron P(n,j,k) = T(j,k)*p(n-j), where T(j,k) = 1 if k divides j otherwise 0.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Formula

A330888 Irregular triangle read by rows: T(n,k) is the number of parts in the partition of n into k consecutive parts that differ by 3, n >= 1, k >= 1, and the first element of column k is in the row that is the k-th pentagonal number (A000326).

A221649 Tetrahedron E(n,j,k) = kT(j,k)p(n-j), where T(j,k) = 1 if k divides j otherwise 0.