A340423 -id:A340423 - cp's OEIS frontend

A066186 Sum of all parts of all partitions of n.

0, 1, 4, 9, 20, 35, 66, 105, 176, 270, 420, 616, 924, 1313, 1890, 2640, 3696, 5049, 6930, 9310, 12540, 16632, 22044, 28865, 37800, 48950, 63336, 81270, 104104, 132385, 168120, 212102, 267168, 334719, 418540, 520905, 647172, 800569, 988570, 1216215, 1493520

Offset: 0

Wouter Meeussen, Dec 15 2001

Sum of the zeroth moments of all partitions of n.
Also the number of one-element transitions from the integer partitions of n to the partitions of n-1 for labeled parts with the assumption that any part z is composed of labeled elements of amount 1, i.e., z = 1_1 + 1_2 + ... + 1_z. Then one can take from z a single element in z different ways. E.g., for n=3 to n=2 we have A066186(3) = 9 and [111] --> [11], [111] --> [11], [111] --> [11], [12] --> [111], [12] --> [111], [12] --> [2], [3] --> 2, [3] --> 2, [3] --> 2. For the unlabeled case, one can take a single element from z in only one way. Then the number of one-element transitions from the integer partitions of n to the partitions of n-1 is given by A000070. E.g., A000070(3) = 4 and for the transition from n=3 to n=2 one has [111] --> [11], [12] --> [11], [12] --> [2], [3] --> [2]. - Thomas Wieder, May 20 2004
Also sum of all parts of all regions of n (Cf. A206437). - Omar E. Pol, Jan 13 2013
From Omar E. Pol, Jan 19 2021: (Start)
Apart from initial zero this is also as follows:
Convolution of A000203 and A000041.
Convolution of A024916 and A002865.
For n >= 1, a(n) is also the number of cells in a symmetric polycube in which the terraces are the symmetric representation of sigma(k), for k = n..1, (cf. A237593) starting from the base and located at the levels A000041(0)..A000041(n-1) respectively. The polycube looks like a symmetric tower (cf. A221529). A dissection is a three-dimensional spiral whose top view is described in A239660. The growth of the volume of the polycube represents each convolution mentioned above. (End)
From Omar E. Pol, Feb 04 2021: (Start)
a(n) is also the sum of all divisors of all positive integers in a sequence with n blocks where the m-th block consists of A000041(n-m) copies of m, with 1 <= m <= n. The mentioned divisors are also all parts of all partitions of n.
Apart from initial zero this is also the convolution of A340793 and A000070. (End)

			a(3)=9 because the partitions of 3 are: 3, 2+1 and 1+1+1; and (3) + (2+1) + (1+1+1) = 9.
a(4)=20 because A000041(4)=5 and 4*5=20.

Vincenzo Librandi, Table of n, a(n) for n = 0..1000
F. G. Garvan, Higher-order spt functions, Adv. Math. 228 (2011), no. 1, 241-265, alternate copy. - From _N. J. A. Sloane_, Jan 02 2013
F. G. Garvan, Higher-order spt functions, arXiv:1008.1207 [math.NT], 2010.
T. J. Osler, A. Hassen and T. R. Chandrupatia, Surprising connections between partitions and divisors, The College Mathematics Journal, Vol. 38. No. 4, Sep. 2007, 278-287 (see p. 287).
Omar E. Pol, Illustration of a(10), prism and tower, each polycube contains 420 cubes.
Omar E. Pol, Illustration of initial terms of A066186 and of A139582 (n>=1)

Cf. A000041, A093694, A000070, A132825, A001787 (same for ordered partitions), A277029, A000203, A221529, A237593, A239660.
First differences give A138879. - Omar E. Pol, Aug 16 2013
Row sums of triangles A138785, A181187, A245099, A337209, A339106, A340423, A340424, A221529, A302246, A338156, A340035, A340056, A340057, A346741. - Omar E. Pol, Aug 02 2021

a066186 = sum . concat . ps 1 where
   ps _ 0 = [[]]
   ps i j = [t:ts | t <- [i..j], ts <- ps t (j - t)]
-- Reinhard Zumkeller, Jul 13 2013

with(combinat): a:= n-> n*numbpart(n): seq(a(n), n=0..50); # Zerinvary Lajos, Apr 25 2007

PartitionsP[ Range[0, 60] ] * Range[0, 60]

a(n)=numbpart(n)*n \\ Charles R Greathouse IV, Mar 10 2012

from sympy import npartitions
def A066186(n): return n*npartitions(n) # Chai Wah Wu, Oct 22 2023

[n*Partitions(n).cardinality() for n in range(41)] # Peter Luschny, Jul 29 2014

a(n) = n * A000041(n). - Omar E. Pol, Oct 10 2011
G.f.: x * (d/dx) Product_{k>=1} 1/(1-x^k), i.e., derivative of g.f. for A000041. - Jon Perry, Mar 17 2004 (adjusted to match the offset by Geoffrey Critzer, Nov 29 2014)
Equals A132825 * [1, 2, 3, ...]. - Gary W. Adamson, Sep 02 2007
a(n) = A066967(n) + A066966(n). - Omar E. Pol, Mar 10 2012
a(n) = A207381(n) + A207382(n). - Omar E. Pol, Mar 13 2012
a(n) = A006128(n) + A196087(n). - Omar E. Pol, Apr 22 2012
a(n) = A220909(n)/2. - Omar E. Pol, Jan 13 2013
a(n) = Sum_{k=1..n} A000203(k)*A000041(n-k), n >= 1. - Omar E. Pol, Jan 20 2013
a(n) = Sum_{k=1..n} k*A036043(n,n-k+1). - L. Edson Jeffery, Aug 03 2013
a(n) = Sum_{k=1..n} A024916(k)*A002865(n-k), n >= 1. - Omar E. Pol, Jul 13 2014
a(n) ~ exp(Pi*sqrt(2*n/3))/(4*sqrt(3)) * (1 - (sqrt(3/2)/Pi + Pi/(24*sqrt(6))) / sqrt(n)). - Vaclav Kotesovec, Oct 24 2016
a(n) = Sum_{k=1..n} A340793(k)*A000070(n-k), n >= 1. - Omar E. Pol, Feb 04 2021

a(0) added by Franklin T. Adams-Watters, Jul 28 2014

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

A340531 Irregular triangle read by rows T(n,k), (n >= 1, k >= 1), in which row n has length is A000070(n-1) and every column k is A024916, the sum of all divisors of all numbers <= n.

Original entry on oeis.org

1, 4, 1, 8, 4, 1, 1, 15, 8, 4, 4, 1, 1, 1, 21, 15, 8, 8, 4, 4, 4, 1, 1, 1, 1, 1, 33, 21, 15, 15, 8, 8, 8, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 41, 33, 21, 21, 15, 15, 15, 8, 8, 8, 8, 8, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 56, 41, 33, 33, 21, 21, 21, 15, 15, 15, 15, 15

Offset: 1

Omar E. Pol, Jan 10 2021

Consider a symmetric tower (a polycube) in which the terraces are the symmetric representation of sigma (n..1) respectively starting from the base (cf. A237270, A237593).
The levels of the terraces starting from the base are the first n terms of A000070, that is A000070(0)..A000070(n-1), hence the differences between two successive levels give the partition numbers A000041, that is A000041(0)..A000041(n-1).
T(n,k) is the volume (the number of cells) in the k-th level starting from the base.
This polycube has the property that the volume (the total number of cells) equals A182738(n), the sum of all parts of all partitions of all positive integers <= n.
A dissection of the symmetric tower is a three-dimensional spiral whose top view is described in A239660.
Other triangles related to the volume of this polycube are A340527 and A340579.
The symmetric tower is a member of the family of the stepped pyramid described in A245092.
For another symmetric tower of the same family and whose volume equals A066186(n) see A340423.
The sum of row n of triangle equals A182738(n). That property is due to the correspondence between divisors and parts. For more information see A336811.

			Triangle begins:
   1;
   4,  1;
   8,  4,  1,  1;
  15,  8,  4,  4, 1, 1, 1;
  21, 15,  8,  8, 4, 4, 4, 1, 1, 1, 1, 1;
  33, 21, 15, 15, 8, 8, 8, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1;
...
For n = 5 the length of row 5 is A000070(4) = 12.
The sum of row 5 is 21 + 15 + 8 + 8 + 4 + 4 + 4 + 1 + 1 + 1 + 1 + 1 = 69, equaling A182738(5).

Row sums give A182738.
Cf. A340527 (a regular version).
Members of the same family are: A176206, A337209, A339258, A340530.
Cf. A221529, A239660, A339278, A339304, A340423, A340529.
Cf. A000070, A024916, A237593, A336811, A338156.

a(m) = A024916(A176206(m)), assuming A176206 has offset 1.

T(n,k) = A024916(A176206(n,k)), assuming A176206 has offset 1.

A340529 Irregular triangle read by rows T(n,k), (n >= 1, k >= 1), in which row n has length A000041(n-1) and every column k is A006218.

Original entry on oeis.org

1, 3, 5, 1, 8, 3, 1, 10, 5, 3, 1, 1, 14, 8, 5, 3, 3, 1, 1, 16, 10, 8, 5, 5, 3, 3, 1, 1, 1, 1, 20, 14, 10, 8, 8, 5, 5, 3, 3, 3, 3, 1, 1, 1, 1, 23, 16, 14, 10, 10, 8, 8, 5, 5, 5, 5, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 27, 20, 16, 14, 14, 10, 10, 8, 8, 8, 8, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1

Offset: 1

Omar E. Pol, Jan 10 2021

			Triangle begins:
   1;
   3;
   5,  1;
   8,  3,  1;
  10,  5,  3,  1,  1;
  14,  8,  5,  3,  3, 1, 1;
  16, 10,  8,  5,  5, 3, 3, 1, 1, 1, 1;
  20, 14, 10,  8,  8, 5, 5, 3, 3, 3, 3, 1, 1, 1, 1;
  23, 16, 14, 10, 10, 8, 8, 5, 5, 5, 5, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1;
...
For n = 6, the length of row 6 is A000041(5) = 7.
The sum of row 6 is 14 + 8 + 5 + 3 + 3 + 1 + 1 = 35, equaling A006128(6).

Row sums give A006128.
Cf. A340525 (a regular version).
Members of the same family are: A336811, A339278, A339304, A340423.
Cf. A337209, A339258, A340530, A340531.
Cf. A000041, A006218.

a(m) = A006218(A336811(m)).

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

A340530 Irregular triangle read by rows T(n,k) in which row n has length is A000070(n-1) and every column k is A006218, (n >= 1, k >= 1).

Original entry on oeis.org

1, 3, 1, 5, 3, 1, 1, 8, 5, 3, 3, 1, 1, 1, 10, 8, 5, 5, 3, 3, 3, 1, 1, 1, 1, 1, 14, 10, 8, 8, 5, 5, 5, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 16, 14, 10, 10, 8, 8, 8, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 20, 16, 14, 14, 10, 10, 10, 8, 8, 8, 8, 8, 5, 5, 5, 5, 5, 5, 5

Offset: 1

Omar E. Pol, Jan 10 2021

The sum of row n equals A284870(n), the total number of parts in all partitions of all positive integers <= n. It is conjectured that this property is due to the correspondence between divisors and partitions. For more information see A336811.

			Triangle begins:
   1;
   3,  1;
   5,  3,  1,  1;
   8,  5,  3,  3, 1, 1, 1;
  10,  8,  5,  5, 3, 3, 3, 1, 1, 1, 1, 1;
  14, 10,  8,  8, 5, 5, 5, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1;
...
For n = 5 the length of row 5 is A000070(4) = 12.
The sum of row 5 is 10 + 8 + 5 + 5 + 3 + 3 + 3 + 1 + 1 + 1 + 1 + 1 = 42, equaling A284870(5).

Row sums give A284870.
Cf. A340526 (a regular version).
Members of the same family are: A176206, A337209, A339258, A340531.
Cf. A339278, A339304, A340423, A340529.
Cf. A000070, A006128, A336811.

a(m) = A006218(A176206(m)), assuming A176206 has offset 1.

T(n,k) = A006218(A176206(n,k)), assuming A176206 has offset 1.

A350637 Triangle read by rows: T(n,k) in which row n lists the first n terms of A024916 in reverse order, 1 <= k <= n.

Original entry on oeis.org

1, 4, 1, 8, 4, 1, 15, 8, 4, 1, 21, 15, 8, 4, 1, 33, 21, 15, 8, 4, 1, 41, 33, 21, 15, 8, 4, 1, 56, 41, 33, 21, 15, 8, 4, 1, 69, 56, 41, 33, 21, 15, 8, 4, 1, 87, 69, 56, 41, 33, 21, 15, 8, 4, 1, 99, 87, 69, 56, 41, 33, 21, 15, 8, 4, 1, 127, 99, 87, 69, 56, 41, 33, 21, 15, 8, 4, 1

Offset: 1

Omar E. Pol, Jan 09 2022

T(n,k) is the number of cubic cells (or cubes) in the k-th level starting from the base of the stepped pyramid with n levels described in A245092 (see example).

			Triangle begins:
    1;
    4,  1;
    8,  4,  1;
   15,  8,  4,  1;
   21, 15,  8,  4,  1;
   33, 21, 15,  8,  4,  1;
   41, 33, 21, 15,  8,  4,  1;
   56, 41, 33, 21, 15,  8,  4,  1;
   69, 56, 41, 33, 21, 15,  8,  4,  1;
   87, 69, 56, 41, 33, 21, 15,  8,  4,  1;
   99, 87, 69, 56, 41, 33, 21, 15,  8,  4,  1;
  127, 99, 87, 69, 56, 41, 33, 21, 15,  8,  4,  1;
...
For n = 9 the lateral view and top view of the stepped pyramid described in A245092 look as shown below:
                        _
     9        1        |_|_
     8        4        |_ _|_
     7        8        |_ _|_|_
     6       15        |_ _ _| |_
     5       21        |_ _ _|_ _|_
     4       33        |_ _ _ _| | |_
     3       41        |_ _ _ _|_|_ _|_
     2       56        |_ _ _ _ _|_|_  |_
     1       69        |_ _ _ _ _|_ _|_ _|
.
   Level   Row 9         Lateral view of
     k     T(9,k)      the stepped pyramid
.
                        _ _ _ _ _ _ _ _ _
                       |_| | | | | | | | |
                       |_ _|_| | | | | | |
                       |_ _|  _|_| | | | |
                       |_ _ _|    _|_| | |
                       |_ _ _|  _|  _ _|_|
                       |_ _ _ _|  _| |
                       |_ _ _ _| |_ _|
                       |_ _ _ _ _|
                       |_ _ _ _ _|
.
                           Top view of
                       the stepped pyramid
.
For n = 9 and k = 1 there are 69 cubic cells in the level 1 starting from the base of the stepped pyramid, so T(9,1) = 69.
For n = 9 and k = 9 there is only one cubic cell in the level k = 9 (the top) of the stepped pyramid, so T(9,9) = 1.
The volume of the stepped pyramid (also the total number of cubic cells) represents the 9th term of the convolution of A000203 and A000027 hence it's equal to A175254(9) = 248, equaling the sum of the 9th row of triangle.

Omar E. Pol, Perspective view of the stepped pyramid (first 16 levels)

Column k gives A024916 starting in row k.
Row sums give A175254.
Cf. A340423 (analog for the tower described in A221529).
Cf. A000027, A000203, A004736, A196020, A235791, A236104, A237591, A237593, A245092, A262626, A272172.

Join@@Array[Reverse@Array[Sum[#-Mod[#,m],{m,#}]&,#]&,12] (* Giorgos Kalogeropoulos, Jan 12 2022 *)

row(n) = Vecrev(vector(n, k, sum(i=1, k, k\i*i))); \\ Michel Marcus, Jan 22 2022

T(n,k) = A024916(A004736(n,k)).
T(n,k) = T(n,k) = A024916(n-k+1).
T(n,k) = Sum_{j=1..n} A272172(j,k).

cp's OEIS Frontend

A066186 Sum of all parts of all partitions of n.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Haskell

Maple

Mathematica

PARI

Python

Sage

Formula

Extensions

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

A340531 Irregular triangle read by rows T(n,k), (n >= 1, k >= 1), in which row n has length is A000070(n-1) and every column k is A024916, the sum of all divisors of all numbers <= n.

Views

Author

Keywords

Comments

Examples

Crossrefs

Formula

A340529 Irregular triangle read by rows T(n,k), (n >= 1, k >= 1), in which row n has length A000041(n-1) and every column k is A006218.

Views

Author

Keywords

Examples

Crossrefs

Formula

A340530 Irregular triangle read by rows T(n,k) in which row n has length is A000070(n-1) and every column k is A006218, (n >= 1, k >= 1).

Views

Author

Keywords

Comments

Examples

Crossrefs

Formula

A350637 Triangle read by rows: T(n,k) in which row n lists the first n terms of A024916 in reverse order, 1 <= k <= n.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Formula