A340424 -id:A340424 - 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

A340524 Triangle read by rows: T(n,k) = A000005(n-k+1)*A002865(k-1), 1 <= k <= n.

Original entry on oeis.org

1, 2, 0, 2, 0, 1, 3, 0, 2, 1, 2, 0, 2, 2, 2, 4, 0, 3, 2, 4, 2, 2, 0, 2, 3, 4, 4, 4, 4, 0, 4, 2, 6, 4, 8, 4, 3, 0, 2, 4, 4, 6, 8, 8, 7, 4, 0, 4, 2, 8, 4, 12, 8, 14, 8, 2, 0, 3, 4, 4, 8, 8, 12, 14, 16, 12, 6, 0, 4, 3, 8, 4, 16, 8, 21, 16, 24, 14, 2, 0, 2, 4, 6, 8, 8, 16, 14, 24, 24, 28, 21

Offset: 1

Omar E. Pol, Jan 10 2021

Conjecture: the sum of row n equals A138137(n), the total number of parts in the last section of the set of partitions of n.

			Triangle begins:
1;
2, 0;
2, 0, 1;
3, 0, 2, 1;
2, 0, 2, 2, 2;
4, 0, 3, 2, 4, 2;
2, 0, 2, 3, 4, 4,  4;
4, 0, 4, 2, 6, 4,  8,  4;
3, 0, 2, 4, 4, 6,  8,  8,  7;
4, 0, 4, 2, 8, 4, 12,  8, 14,  8;
2, 0, 3, 4, 4, 8,  8, 12, 14, 16, 12;
6, 0, 4, 3, 8, 4, 16,  8, 21, 16, 24, 14;
2, 0, 2, 4, 6, 8,  8, 16, 14, 24, 24, 28, 21;
...
For n = 6 the calculation of every term of row 6 is as follows:
--------------------------
k   A002865         T(6,k)
--------------------------
1      1   *   4   =   4
2      0   *   2   =   0
3      1   *   3   =   3
4      1   *   2   =   2
5      2   *   2   =   4
6      2   *   1   =   2
.           A000005
--------------------------
The sum of row 6 is 4 + 0 + 3 + 2 + 4 + 2 = 15, equaling A138137(6) = 15.

Row sums give A138137 (conjectured).
Columns 1, 3 and 4 are A000005.
Column 2 gives A000004.
Columns 5 and 6 give A062011.
Columns 7 and 8 give A145154, n >= 1.
Leading diagonal gives A002865.
Cf. A339304 (irregular or expanded version).
Cf. A135010, A138121, A221531, A336811, A339106, A340424, A340426.

f(n) = if (n==0, 1, numbpart(n) - numbpart(n-1)); \\ A002865
T(n, k) = numdiv(n-k+1) * f(k-1); \\ Michel Marcus, Jan 13 2021

A340527 Triangle read by rows: T(n,k) = A024916(n-k+1)*A000041(k-1), 1 <= k <= n.

Original entry on oeis.org

1, 4, 1, 8, 4, 2, 15, 8, 8, 3, 21, 15, 16, 12, 5, 33, 21, 30, 24, 20, 7, 41, 33, 42, 45, 40, 28, 11, 56, 41, 66, 63, 75, 56, 44, 15, 69, 56, 82, 99, 105, 105, 88, 60, 22, 87, 69, 112, 123, 165, 147, 165, 120, 88, 30, 99, 87, 138, 168, 205, 231, 231, 225, 176, 120, 42, 127, 99, 174

Offset: 1

Omar E. Pol, Jan 10 2021

Conjecture 1: T(n,k) is the sum of divisors of the terms that are in the k-th blocks of the first n rows of triangle A176206.
Conjecture 2: the sum of row n equals A182738(n), the sum of all parts of all partitions of all positive integers <= n.
Conjecture 3: T(n,k) is also the volume (or number of cubes) of the k-th block of a symmetric tower in which the terraces are the symmetric representation of sigma (n..1) starting from the base respectively (cf. A237270, A237593), hence the total area of the terraces is A024916(n), the same as the area of the base.
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 levels give the partition numbers A000041, that is A000041(0)..A000041(n-1).
This symmetric tower has the property that its volume (or total number of cubes) equals A182738(n), the sum of all parts of all partitions of all positive integers <= n.
For another symmetric tower of the same family and whose volume equals A066186(n) see A339106 and A221529.
The above three conjectures are connected due to the correspondence between divisors and partitions (cf. A336811).

			Triangle begins:
   1;
   4,   1;
   8,   4,   2;
  15,   8,   8,   3;
  21,  15,  16,  12,   5;
  33,  21,  30,  24,  20,   7;
  41,  33,  42,  45,  40,  28,  11;
  56,  41,  66,  63,  75,  56,  44,  15;
  69,  56,  82,  99, 105, 105,  88,  60,  22;
  87,  69, 112, 123, 165, 147, 165, 120,  88,  30;
  99,  87, 138, 168, 205, 231, 231, 225, 176, 120,  42;
...
For n = 6 the calculation of every term of row 6 is as follows:
--------------------------
k   A000041         T(6,k)
1      1  *  33   =   33
2      1  *  21   =   21
3      2  *  15   =   30
4      3  *   8   =   24
5      5  *   4   =   20
6      7  *   1   =    7
.          A024916
--------------------------
The sum of row 6 is 33 + 21 + 30 + 24 + 20 + 7 = 135, equaling A182738(6).

Columns 1 and 2 give A024916.
Column 3 gives A327329.
Leading diagonal gives A000041.
Row sums give A182738.
Cf. A000070, A066186, A176206, A221529, A221531, A237270, A237593, A336811, A336812, A338156, A339106, A340035,  A340424, A340425, A340426, A340524, A340526.

A340525 Triangle read by rows: T(n,k) = A006218(n-k+1)*A002865(k-1), 1 <= k <= n.

Original entry on oeis.org

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

Offset: 1

Omar E. Pol, Jan 10 2021

Conjecture: the sum of row n equals A006128(n), the total number of parts in all partitions of n.

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

Mirror of A245095.
Row sums give A006128 (conjectured).
Columns 1, 3 and 4 are A006218.
Column 2 gives A000004.
Leading diagonal gives A002865.
Cf. A135010, A138121, A221531, A336811, A339106, A340424, A340524, A340426.

A340526 Triangle read by rows: T(n,k) = A006218(n-k+1)*A000041(k-1), 1 <= k <= n.

Original entry on oeis.org

1, 3, 1, 5, 3, 2, 8, 5, 6, 3, 10, 8, 10, 9, 5, 14, 10, 16, 15, 15, 7, 16, 14, 20, 24, 25, 21, 11, 20, 16, 28, 30, 40, 35, 33, 15, 23, 20, 32, 42, 50, 56, 55, 45, 22, 27, 23, 40, 48, 70, 70, 88, 75, 66, 30, 29, 27, 46, 60, 80, 98, 110, 120, 110, 90, 42, 35, 29, 54, 69, 100, 112, 154, 150, 176, 150, 126, 56

Offset: 1

Omar E. Pol, Jan 10 2021

Conjecture 1: T(n,k) is the total number of divisors of the terms that are in the k-th blocks of the first n rows of triangle A176206.
Conjecture 2: the sum of row n equals A284870, the total number of parts in all partitions of all positive integers <= n.
The above conjectures are connected due to the correspondence between divisors and partitions (cf. A336811).

			Triangle begins:
   1;
   3,  1;
   5,  3,  2;
   8,  5,  6,  3;
  10,  8, 10,  9,   5;
  14, 10, 16, 15,  15,   7;
  16, 14, 20, 24,  25,  21,  11;
  20, 16, 28, 30,  40,  35,  33,  15;
  23, 20, 32, 42,  50,  56,  55,  45,  22;
  27, 23, 40, 48,  70,  70,  88,  75,  66,  30;
  29, 27, 46, 60,  80,  98, 110, 120, 110,  90,  42;
  35, 29, 54, 69, 100, 112, 154, 150, 176, 150, 126,  56;
...
For n = 6 the calculation of every term of row 6 is as follows:
--------------------------
k   A000041         T(6,k)
1      1  *  14   =   14
2      1  *  10   =   10
3      2  *   8   =   16
4      3  *   5   =   15
5      5  *   3   =   15
6      7  *   1   =    7
.          A006218
--------------------------
The sum of row 6 is 14 + 10 + 16 + 15 + 15 + 7 = 77, equaling A284870(6).

Columns 1 and 2 give A006218.
Leading diagonal gives A000041.
Row sums give A284870.
Cf. A176206, A221531, A339106, A340424, A340425, A340524, A340426, A340527, A336811.

f(n) = sum(k=1, n, n\k); \\ A006218
T(n,k) = f(n-k+1)*numbpart(k-1); \\ Michel Marcus, Jan 15 2021

A340579 Triangle read by rows: T(n,k) = A000203(n-k+1)*A000070(k-1), 1 <= k <= n.

Original entry on oeis.org

1, 3, 2, 4, 6, 4, 7, 8, 12, 7, 6, 14, 16, 21, 12, 12, 12, 28, 28, 36, 19, 8, 24, 24, 49, 48, 57, 30, 15, 16, 48, 42, 84, 76, 90, 45, 13, 30, 32, 84, 72, 133, 120, 135, 67, 18, 26, 60, 56, 144, 114, 210, 180, 201, 97, 12, 36, 52, 105, 96, 228, 180, 315, 268, 291, 139, 28, 24, 72, 91

Offset: 1

Omar E. Pol, Jan 12 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 total area of the terraces equals A024916(n), the same as the area of the base.
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 total volume (or total number of cubes) exactly below the symmetric representation of sigma(n-k+1). In other words: T(n,k) is the total volume (the total number of cubes) exactly below the terraces that are in the k-th level that contains terraces starting from the base.
This symmetric tower has the property that its volume (the total number of cubes) equals A182738(n), the sum of all parts of all partitions of all positive integers <= n. That is due to the correspondence between divisors and partitions (cf. A336811).
The growth of the volume represents the convolution of A000203 and A000070.
The symmetric tower is a member of the family of the pyramid described in A245092.
For another symmetric tower of the same family and whose volume equals A066186(n) see A221529 and A339106.

			Triangle begins:
   1;
   3,   2;
   4,   6,   4;
   7,   8,  12,   7;
   6,  14,  16,  21,  12;
  12,  12,  28,  28,  36,  19;
   8,  24,  24,  49,  48,  57,  30;
  15,  16,  48,  42,  84,  76,  90,  45;
  13,  30,  32,  84,  72, 133, 120, 135,  67;
  18,  26,  60,  56, 144, 114, 210, 180, 201,  97;
  12,  36,  52, 105,  96, 228, 180, 315, 268, 291, 139;
...
For n = 6 the calculation of every term of row 6 is as follows:
-------------------------
k   A000070        T(6,k)
1      1  *  12  =   12
2      2  *  6   =   12
3      4  *  7   =   28
4      7  *  4   =   28
5     12  *  3   =   36
6     19  *  1   =   19
.         A000203
-------------------------
The sum of row 6 is 12 + 12 + 28 + 28 + 36 + 19 = 135, equaling A182738(6).

Row sums give A182738.

Cf. A000070, A000203, A024916, A221529, A221531, A237593, A339106, A340424, A340426, A340524, A340525, A340526, A340527, A340531.

row(n) = vector(n, k, sigma(n-k+1)*sum(i=0, k-1, numbpart(i))); \\ Michel Marcus, Jul 23 2021

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

A340524 Triangle read by rows: T(n,k) = A000005(n-k+1)*A002865(k-1), 1 <= k <= n.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

PARI

A340527 Triangle read by rows: T(n,k) = A024916(n-k+1)*A000041(k-1), 1 <= k <= n.

Views

Author

Keywords

Comments

Examples

Crossrefs

A340525 Triangle read by rows: T(n,k) = A006218(n-k+1)*A002865(k-1), 1 <= k <= n.

Views

Author

Keywords

Comments

Examples

Crossrefs

A340526 Triangle read by rows: T(n,k) = A006218(n-k+1)*A000041(k-1), 1 <= k <= n.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

PARI

A340579 Triangle read by rows: T(n,k) = A000203(n-k+1)*A000070(k-1), 1 <= k <= n.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

PARI