A210953 -id:A210953 - cp's OEIS frontend

A014153 Expansion of 1/((1-x)^2*Product_{k>=1} (1-x^k)).

1, 3, 7, 14, 26, 45, 75, 120, 187, 284, 423, 618, 890, 1263, 1771, 2455, 3370, 4582, 6179, 8266, 10980, 14486, 18994, 24757, 32095, 41391, 53123, 67865, 86325, 109350, 137979, 173450, 217270, 271233, 337506, 418662, 517795, 638565, 785350, 963320, 1178628

Offset: 0

N. J. A. Sloane

nonn

Number of partitions of n with three kinds of 1. E.g., a(2)=7 because we have 2, 1+1, 1+1', 1+1", 1'+1', 1'+1", 1"+1". - Emeric Deutsch, Mar 22 2005
Partial sums of the partial sums of the partition numbers A000041. Partial sums of A000070. Euler transform of 3,1,1,1,...
Also sum of parts, counted without multiplicity, in all partitions of n, offset 1. Also Sum phi(p), where the sum is taken over all parts p of all partitions of n, offset 1. - Vladeta Jovovic, Mar 26 2005
Equals row sums of triangle A141157. - Gary W. Adamson, Jun 12 2008
A014153 convolved with A010815 = (1, 2, 3, ...). n-th partial sum sequence of A000041 convolved with A010815 = (n-1)-th column of Pascal's triangle, starting (1, n, ...). - Gary W. Adamson, Nov 09 2008
From Omar E. Pol, May 25 2012: (Start)
a(n) is also the sum of all parts of the (n+1)st column of a version of the section model of partitions in which every section has its parts aligned to the right margin (cf. A210953, A210970, A135010).
Rows of triangle A210952 converge to this sequence. (End)
Using the above result (see Jovovic's comment) of Jovovic and Mertens's theorem on the average order of the phi function, we can obtain the estimate a(n-1) = (6/Pi^2)*n*p(n) + O(log(n)*A006128(n)), where p(n) is the partition function A000041(n). It can be shown that A006128(n) = O(sqrt(n)*log(n)*p(n)), so we have the asymptotic result a(n) ~ (6/Pi^2)*n*p(n). - Peter Bala, Dec 23 2013
a(n-2) is the number of partitions of 2n or 2n-1 with palindromicity 2; that is, partitions that can be listed in palindromic order except for a central sequence of two distinct parts. - Gregory L. Simay, Nov 01 2015
Convolution of A000041 and A000027. - Omar E. Pol, Jun 17 2021
Convolution of A002865 and the positive terms of A000217. Partial sums give A014160. - Omar E. Pol, Mar 01 2023

Alois P. Heinz and Vaclav Kotesovec, Table of n, a(n) for n = 0..10000 (terms 0..1000 from Alois P. Heinz)
Mircea Merca and Maxie D. Schmidt, The partition function p(n) in terms of the classical Möbius function, arXiv:2310.13658 [math.CO], 2023.

Cf. A000041, A000070, A116930, A141157.
Cf. A010815. - Gary W. Adamson, Nov 09 2008
Column k=3 of A292508.
Cf. A000217, A002865, A014160.

m:=45; R:=PowerSeriesRing(Integers(), m); Coefficients(R!( 1/((1-x)^2*(&*[1-x^k: k in [1..50]])) )); // G. C. Greubel, Oct 15 2018

with(numtheory):
a:= proc(n) option remember;
      `if`(n=0, 1, add((2+sigma(j)) *a(n-j), j=1..n)/n)
    end:
seq(a(n), n=0..40);  # Alois P. Heinz, Feb 13 2012

a[n_] := a[n] = If[n == 0, 1, Sum[(2+DivisorSigma[1, j])*a[n-j], {j, 1, n}]/n]; Table[a[n], {n, 0, 40}] (* Jean-François Alcover, Mar 03 2014, after Alois P. Heinz *)
Table[Sum[(n-k)*PartitionsP[k],{k,0,n}],{n,1,50}] (* Vaclav Kotesovec, Jun 23 2015 *)
t[n_, k_] := Sum[StirlingS1[n, j]* Binomial[i + j - 1, i]* PartitionsP[k - n - i], {j, 0, n}, {i, 0, k - n}]; Print@ Table[t[n, k], {k, 10}, {n, 0, k - 1}]; Table[t[2, k], {k, 3, 43}] (* George Beck, May 25 2016 *)

x='x+O('x^45); Vec(1/((1-x)^2*prod(k=1,50, 1-x^k))) \\ G. C. Greubel, Oct 15 2018

Let t(n_, k_) = Sum_{i = 0..k} Sum_{j = 0..n} s(n, j)*C(i,  j)*p(k - n - i), where s(n, j) are Stirling numbers of the first kind, C(i, j) are the number of compositions of i distinct objects into j parts, and p is the integer partition function. Then a(k) = t(2, k+2) (conjectured). The formula for t(n, k) is the same as at A126442 except that there the Stirling numbers are of the second kind. - George Beck, May 21 2016
a(n) = (n+1)*A000070(n+1) - A182738(n+1). - Vaclav Kotesovec, Nov 04 2016
a(n) ~ exp(sqrt(2*n/3)*Pi)*sqrt(3)/(2*Pi^2) * (1 + 23*Pi/(24*sqrt(6*n))). - Vaclav Kotesovec, Nov 04 2016

A210952 Triangle read by rows: T(n,k) = sum of all parts of the k-th column of the partitions of n but with the partitions aligned to the right margin.

Original entry on oeis.org

1, 1, 3, 1, 3, 5, 1, 3, 7, 9, 1, 3, 7, 12, 12, 1, 3, 7, 14, 21, 20, 1, 3, 7, 14, 24, 31, 25, 1, 3, 7, 14, 26, 40, 47, 38, 1, 3, 7, 14, 26, 43, 61, 66, 49, 1, 3, 7, 14, 26, 45, 70, 92, 93, 69, 1, 3, 7, 14, 26, 45, 73, 106, 130, 124, 87, 1, 3, 7, 14

Offset: 1

Omar E. Pol, Apr 22 2012

			For n = 6 the illustration shows the partitions of 6 aligned to the right margin and below the sums of the columns:
.
.                      6
.                  3 + 3
.                  4 + 2
.              2 + 2 + 2
.                  5 + 1
.              3 + 2 + 1
.              4 + 1 + 1
.          2 + 2 + 1 + 1
.          3 + 1 + 1 + 1
.      2 + 1 + 1 + 1 + 1
.  1 + 1 + 1 + 1 + 1 + 1
-------------------------
.  1,  3,  7, 14, 21, 20
.
So row 6 lists 1, 3, 7, 14, 21, 20.
Triangle begins:
1;
1, 3;
1, 3, 5;
1, 3, 7,  9;
1, 3, 7, 12, 12;
1, 3, 7, 14, 21, 20;
1, 3, 7, 14, 24, 31, 25;
1, 3, 7, 14, 26, 40, 47, 38;
1, 3, 7, 14, 26, 43, 61, 66, 49;
1, 3, 7, 14, 26, 45, 70, 92, 93, 69:

Mirror of triangle A206283. Rows sums give A066186. Rows converge to A014153. Right border gives A046746, >= 1.

Cf. A135010, A138121, A181187, A210763, A210950, A210951, A210953, A210961, A210970.

T(n,k) = Sum_{j=1..n} A210953(j,k). - Omar E. Pol, May 26 2012

A210950 Triangle read by rows: T(n,k) = number of parts in the k-th column of the partitions of n but with the partitions aligned to the right margin.

Original entry on oeis.org

1, 1, 2, 1, 2, 3, 1, 2, 4, 5, 1, 2, 4, 6, 7, 1, 2, 4, 7, 10, 11, 1, 2, 4, 7, 11, 14, 15, 1, 2, 4, 7, 12, 17, 21, 22, 1, 2, 4, 7, 12, 18, 25, 29, 30, 1, 2, 4, 7, 12, 19, 28, 36, 41, 42, 1, 2, 4, 7, 12, 19, 29, 40, 50, 55, 56, 1, 2, 4, 7, 12, 19, 30, 43

Offset: 1

Omar E. Pol, Apr 22 2012

Index of the first partition of n that has k parts, when the partitions of n are listed in reverse lexicographic order, as in Mathematica's IntegerPartitions[n]. - Clark Kimberling, Oct 16 2023

			For n = 6 the partitions of 6 aligned to the right margin look like this:
.
.                      6
.                  3 + 3
.                  4 + 2
.              2 + 2 + 2
.                  5 + 1
.              3 + 2 + 1
.              4 + 1 + 1
.          2 + 2 + 1 + 1
.          3 + 1 + 1 + 1
.      2 + 1 + 1 + 1 + 1
.  1 + 1 + 1 + 1 + 1 + 1
.
The number of parts in columns 1-6 are
.  1,  2,  4,  7, 10, 11, the same as the 6th row of triangle.
Triangle begins:
  1;
  1, 2;
  1, 2, 3;
  1, 2, 4, 5;
  1, 2, 4, 6, 7;
  1, 2, 4, 7, 10, 11;
  1, 2, 4, 7, 11, 14, 15;
  1, 2, 4, 7, 12, 17, 21, 22;
  1, 2, 4, 7, 12, 18, 25, 29, 30;
  1, 2, 4, 7, 12, 19, 28, 36, 41, 42;
  1, 2, 4, 7, 12, 19, 29, 40, 50, 55, 56;
  1, 2, 4, 7, 12, 19, 30, 43, 58, 70, 76, 77;

Mirror of A058399. Row sums give A006128. Right border gives A000041, n >= 1. Rows converge to A000070.

Cf. A135010, A194714, A210945, A210951, A210952, A210953, A210970.

m[n_, k_] := Length[IntegerPartitions[n][[k]]]; c[n_] := PartitionsP[n];
t[n_, h_] := Select[Range[c[n]], m[n, #] == h &, 1];
Column[Table[t[n, h], {n, 1, 20}, {h, 1, n}]]
 (* Clark Kimberling, Oct 16 2023 *)

T(n,k) = Sum_{j=1..n} A210951(j,k).

A210951 Triangle read by rows: T(n,k) = number of parts in the k-th column of the shell model of partitions considering only the n-th shell and with its parts aligned to the right margin.

Original entry on oeis.org

1, 0, 2, 0, 0, 3, 0, 0, 1, 5, 0, 0, 0, 1, 7, 0, 0, 0, 1, 3, 11, 0, 0, 0, 0, 1, 3, 15, 0, 0, 0, 0, 1, 3, 6, 22, 0, 0, 0, 0, 0, 1, 4, 7, 30, 0, 0, 0, 0, 0, 1, 3, 7, 11, 42, 0, 0, 0, 0, 0, 0, 1, 4, 9, 13, 56, 0, 0, 0, 0, 0, 0, 1, 3, 8, 15, 20, 77, 0, 0, 0

Offset: 1

Omar E. Pol, Apr 22 2012

			For n = 6 and k = 1..6 the 6th shell looks like this:
-------------------------
k: 1,  2,  3,  4,  5,  6
-------------------------
.                      6
.                  3 + 3
.                  4 + 2
.              2 + 2 + 2
.                      1
.                      1
.                      1
.                      1
.                      1
.                      1
.                      1
.
The total number of parts in columns 1-6 are
.  0,  0,  0,  1,  3, 11, the same as the 6th row of triangle.
Triangle begins:
1;
0, 2;
0, 0, 3;
0, 0, 1, 5;
0, 0, 0, 1, 7;
0, 0, 0, 1, 3, 11;
0, 0, 0, 0, 1, 3, 15;
0, 0, 0, 0, 1, 3, 6, 22;
0, 0, 0, 0, 0, 1, 4, 7, 30;
0, 0, 0, 0, 0, 1, 3, 7, 11, 42;
0, 0, 0, 0, 0, 0, 1, 4, 9, 13, 56;
0, 0, 0, 0, 0, 0, 1, 3, 8, 15, 20, 77;

Row sums give A138137. Column sums converge to A000070. Right border gives A000041, n >= 1.

Cf. A135010, A138121, A194714, A210945, A210950, A210952, A210953.

A210946 Triangle read by rows: T(n,k) = sum of parts in the k-th column of the mirror of the last section of the set of partitions of n with its parts aligned to the right margin.

Original entry on oeis.org

1, 3, 5, 9, 2, 12, 3, 20, 9, 2, 25, 11, 3, 38, 22, 9, 2, 49, 28, 14, 3, 69, 44, 26, 9, 2, 87, 55, 37, 14, 3, 123, 83, 62, 29, 9, 2, 152

Offset: 1

Omar E. Pol, Apr 21 2012

Row n lists the positive terms of the n-th row of triangle A210953 in decreasing order.

			For n = 7 the illustration shows two arrangements of the last section of the set of partitions of 7:
.
.       (7)        (7)
.     (4+3)        (3+4)
.     (5+2)        (2+5)
.   (3+2+2)        (2+2+3)
.       (1)        (1)
.       (1)        (1)
.       (1)        (1)
.       (1)        (1)
.       (1)        (1)
.       (1)        (1)
.       (1)        (1)
.       (1)        (1)
.       (1)        (1)
.       (1)        (1)
.       (1)        (1)
.                 ---------
.                  25,11,3
.
The left hand picture shows the last section of 7 with its parts aligned to the right margin. In the right hand picture (the mirror) we can see that the sum of all parts of the columns 1..3 are 25, 11, 3 therefore row 7 lists 25, 11, 3.
Written as a triangle begins:
1;
3;
5;
9,    2;
12,   3;
20,   9,  2;
25,  11,  3;
38,  22,  9,  2;
49,  28, 14,  3;
69,  44, 26,  9,  2;
87,  55, 37, 14,  3,
123, 83, 62, 29,  9,  2;

Column 1 is A046746, n >= 1. Row sums give A138879.

Cf. A135010, A138121, A182703, A194714, A196807, A206437, A207031, A207034, A207035, A210945, A210952, A210953.

cp's OEIS Frontend

A014153 Expansion of 1/((1-x)^2*Product_{k>=1} (1-x^k)).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Magma

Maple

Mathematica

PARI

Formula

A210952 Triangle read by rows: T(n,k) = sum of all parts of the k-th column of the partitions of n but with the partitions aligned to the right margin.

Views

Author

Keywords

Examples

Crossrefs

Formula

A210950 Triangle read by rows: T(n,k) = number of parts in the k-th column of the partitions of n but with the partitions aligned to the right margin.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Formula

A210951 Triangle read by rows: T(n,k) = number of parts in the k-th column of the shell model of partitions considering only the n-th shell and with its parts aligned to the right margin.

Views

Author

Keywords

Examples

Crossrefs

A210946 Triangle read by rows: T(n,k) = sum of parts in the k-th column of the mirror of the last section of the set of partitions of n with its parts aligned to the right margin.

Views

Author

Keywords

Comments

Examples

Crossrefs