A181187 -id:A181187 - cp's OEIS frontend

A024792 Number of 8's in all partitions of n.

0, 0, 0, 0, 0, 0, 0, 1, 1, 2, 3, 5, 7, 11, 15, 23, 31, 44, 59, 82, 108, 146, 191, 254, 328, 429, 549, 709, 900, 1148, 1446, 1829, 2286, 2865, 3559, 4427, 5465, 6752, 8288, 10178, 12429, 15175, 18442, 22404, 27102, 32767, 39473, 47516, 57012, 68349, 81703, 97579, 116236

Offset: 1

Clark Kimberling

The sums of eight successive terms give A000070. - Omar E. Pol, Jul 12 2012

a(n) is also the difference between the sum of 8th largest and the sum of 9th largest elements in all partitions of n. - Omar E. Pol, Oct 25 2012

Alois P. Heinz, Table of n, a(n) for n = 1..1000
David Benson, Radha Kessar, and Markus Linckelmann, Hochschild cohomology of symmetric groups in low degrees, arXiv:2204.09970 [math.GR], 2022.

Cf. A000041, A066633, A024786, A024787, A024788, A024789, A024790, A024791, A024793, A024794.

b:= proc(n, i) option remember; local g;
      if n=0 or i=1 then [1, 0]
    else g:= `if`(i>n, [0$2], b(n-i, i));
         b(n, i-1) +g +[0, `if`(i=8, g[1], 0)]
      fi
    end:
a:= n-> b(n, n)[2]:
seq(a(n), n=1..100);  # Alois P. Heinz, Oct 27 2012

Table[ Count[ Flatten[ IntegerPartitions[n]], 8], {n, 1, 53} ]
(* second program: *)
b[n_, i_] := b[n, i] = Module[{g}, If[n == 0 || i == 1, {1, 0}, g = If[i > n, {0, 0}, b[n - i, i]]; b[n, i - 1] + g + {0, If[i == 8, g[[1]], 0]}]]; a[n_] := b[n, n][[2]]; Table[a[n], {n, 1, 100}] (* Jean-François Alcover, Oct 09 2015, after Alois P. Heinz *)

a(n) = A181187(n,8) - A181187(n,9). - Omar E. Pol, Oct 25 2012
From Peter Bala, Dec 26 2013: (Start)
a(n+8) - a(n) = A000041(n). a(n) + a(n+4) = A024788(n).
a(n) + a(n+2) + a(n+4) + a(n+6) = A024786(n).
O.g.f.: x^8/(1 - x^8) * product {k >= 1} 1/(1 - x^k) = x^8 + x^9 + 2*x^10 + 3*x^11 + ....
Asymptotic result: log(a(n)) ~ 2*sqrt(Pi^2/6)*sqrt(n) as n -> inf. (End)
a(n) ~ exp(Pi*sqrt(2*n/3)) / (16*Pi*sqrt(2*n)) * (1 - 97*Pi/(24*sqrt(6*n)) + (97/48 + 6337*Pi^2/6912)/n). - Vaclav Kotesovec, Nov 05 2016

A024793 Number of 9's in all partitions of n.

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 2, 3, 5, 7, 11, 15, 22, 31, 43, 58, 80, 106, 142, 187, 246, 319, 416, 533, 685, 872, 1108, 1397, 1762, 2204, 2755, 3426, 4251, 5250, 6476, 7950, 9746, 11905, 14514, 17638, 21403, 25888, 31265, 37661, 45288, 54329, 65079, 77775

Offset: 1

Clark Kimberling

The sums of nine successive terms give A000070. - Omar E. Pol, Jul 12 2012

a(n) is also the difference between the sum of 9th largest and the sum of 10th largest elements in all partitions of n. - Omar E. Pol, Oct 25 2012

Alois P. Heinz, Table of n, a(n) for n = 1..1000
David Benson, Radha Kessar, and Markus Linckelmann, Hochschild cohomology of symmetric groups in low degrees, arXiv:2204.09970 [math.GR], 2022.

Cf. A000041, A066633, A024786, A024787, A024788, A024789, A024790, A024791, A024792, A024794.

b:= proc(n, i) option remember; local g;
      if n=0 or i=1 then [1, 0]
    else g:= `if`(i>n, [0$2], b(n-i, i));
         b(n, i-1) +g +[0, `if`(i=9, g[1], 0)]
      fi
    end:
a:= n-> b(n, n)[2]:
seq(a(n), n=1..100);  # Alois P. Heinz, Oct 27 2012

Table[ Count[ Flatten[ IntegerPartitions[n]], 9], {n, 1, 55} ]
(* second program: *)
b[n_, i_] := b[n, i] = Module[{g}, If[n == 0 || i == 1, {1, 0}, g = If[i > n, {0, 0}, b[n - i, i]]; b[n, i - 1] + g + {0, If[i == 9, g[[1]], 0]}]]; a[n_] := b[n, n][[2]]; Table[a[n], {n, 1, 100}] (* Jean-François Alcover, Oct 09 2015, after Alois P. Heinz *)

a(n) = A181187(n,9) - A181187(n,10). - Omar E. Pol, Oct 25 2012
From Peter Bala, Dec 26 2013: (Start)
a(n+9) - a(n) = A000041(n).
a(n) + a(n+3) + a(n+6) = A024787(n).
O.g.f.: x^9/(1 - x^9) * product {k >= 1} 1/(1 - x^k) = x^9 + x^10 + 2*x^11 + 3*x^12 + ....
Asymptotic result: log(a(n)) ~ 2*sqrt(Pi^2/6)*sqrt(n) as n -> inf. (End)
a(n) ~ exp(Pi*sqrt(2*n/3)) / (18*Pi*sqrt(2*n)) * (1 - 109*Pi/(24*sqrt(6*n)) + (109/48 + 7993*Pi^2/6912)/n). - Vaclav Kotesovec, Nov 05 2016

A208478 Triangle read by rows: T(n,k) = number of partitions of n with positive k-th rank.

Original entry on oeis.org

0, 1, 1, 1, 1, 1, 2, 1, 2, 1, 3, 1, 3, 2, 1, 5, 2, 4, 4, 2, 1, 6, 3, 5, 6, 4, 2, 1, 10, 5, 7, 9, 7, 4, 2, 1, 13, 7, 9, 11, 11, 7, 4, 2, 1, 19, 11, 12, 15, 16, 12, 7, 4, 2, 1, 25, 16, 15, 19, 22, 18, 12, 7, 4, 2, 1, 35, 24, 20, 26, 29, 27, 19, 12, 7, 4, 2, 1

Offset: 1

Omar E. Pol, Mar 07 2012

We define the k-th rank of a partition as the k-th part minus the number of parts >= k. Every partition of n has n ranks. This is a generalization of the Dyson's rank of a partition which is the largest part minus the number of parts. Since the first part of a partition is also the largest part of the same partition so the Dyson's rank of a partition is the case for k = 1.
The sum of the k-th ranks of all partitions of n is equal to zero.
Also T(n,k) = number of partitions of n with negative k-th rank.
It appears that reversed rows converge to A000070, the same as A208482. - Omar E. Pol, Mar 11 2012
From Omar E. Pol, Dec 12 2019: (Start)
1) The k-th part of a partition of n is also the number of parts >= k of its conjugate partition.
2) The k-th rank of a partitions is also the number of parts >= k of its conjugate partition minus the number of parts >= k.
For example: for n = 9 consider the partition [5, 3, 1]. The first part is 5, so the conjugate partition has five parts >= 1. The second part is 3, so the conjugate partition has three parts >= 2. The third part is 1, so the conjugate partition has only one part >= 3. The mentioned conjugate partition is [3, 2, 2, 1, 1]. And conversely, consider the partition [3, 2, 2, 1, 1]. The first part is 3, so the conjugate partition has three parts >= 1. The second part is 2, so the conjugate partition has two parts >= 2. the Third part is 2, so the conjugate partition has two parts >= 3, and so on. In this case the conjugate partition is [5, 3, 1].
3) The difference between the k-th part and the (k+1)-st part of the partition of n is also the number of k's in its conjugate partition. For example: consider the partition [5, 3, 1]. The difference between the first and the second part is 5 - 3 = 2, equals the number of 1's in its conjugate partition. The difference between the second and the third part is 3 - 1 = 2, equals the number of 2's in its conjugate partition. The difference between the third and the fourth (virtual) part is 1 - 0 = 1, equals the number of 3's in its conjugate partition [3, 2, 2, 1, 1]. And conversely, consider the partition [3, 2, 2, 1, 1]. The difference between the first and the second part is 3 - 2 = 1, equals the number of 1's in its conjugate partition. The difference between the second and the third part is 2 - 2 = 0, equals the number of 2's in its conjugate partition. The difference between the third and the fourth part is 2 - 1 = 1, equals the number of 3's in its conjugate partition, and so on.
4) The list of n ranks of a partition of n equals the list of n ranks multiplied by -1 of its conjugate partition. For example the nine ranks of the partition [5, 3, 1] of 9 are [2, 1, -1, -1, -1, -1, 0, 0, 0], and the nine ranks of its conjugate partition [3, 2, 2, 1, 1] are [-2, -1, 1, 1, 1, 1, 0, 0, 0].
For a list of partitions of the positive integers ordered by its k-th ranks see A330370. (End)

			For n = 4 the partitions of 4 and the four types of ranks of the partitions of 4 are
----------------------------------------------------------
Partitions    First      Second       Third      Fourth
of 4          rank        rank        rank        rank
----------------------------------------------------------
4           4-1 =  3    0-1 = -1    0-1 = -1    0-1 = -1
3+1         3-2 =  1    1-1 =  0    0-1 = -1    0-0 =  0
2+2         2-2 =  0    2-2 =  0    0-0 =  0    0-0 =  0
2+1+1       2-3 = -1    1-1 =  0    1-0 =  1    0-0 =  0
1+1+1+1     1-4 = -3    1-0 =  1    1-0 =  1    1-0 =  1
----------------------------------------------------------
The number of partitions of 4 with positive k-th ranks are 2, 1, 2, 1 so row 4 lists 2, 1, 2, 1.
Triangle begins:
   0;
   1,  1;
   1,  1,  1;
   2,  1,  2,  1;
   3,  1,  3,  2,  1;
   5,  2,  4,  4,  2,  1;
   6,  3,  5,  6,  4,  2,  1;
  10,  5,  7,  9,  7,  4,  2,  1;
  13,  7,  9, 11, 11,  7,  4,  2,  1;
  19, 11, 12, 15, 16, 12,  7,  4,  2,  1;
  25, 16, 15, 19, 22, 18, 12,  7,  4,  2,  1;
  35, 24, 20, 26, 29, 27, 19, 12,  7,  4,  2,  1;
  ...

Alois P. Heinz, Rows n = 1..44, flattened

Column 1 is A064173.
Row sums give A208479.
Cf. A063995, A105805, A181187, A194547, A194549, A195822, A208482, A208483, A209616, A330368, A330369, A330370.

More terms from Alois P. Heinz, Mar 11 2012

A209423 Difference between the number of odd parts and the number of even parts in all the partitions of n.

Original entry on oeis.org

1, 1, 4, 4, 10, 13, 24, 30, 52, 68, 105, 137, 202, 264, 376, 485, 669, 864, 1162, 1486, 1968, 2501, 3256, 4110, 5285, 6630, 8434, 10511, 13241, 16417, 20505, 25273, 31344, 38438, 47346, 57782, 70746, 85947, 104663, 126594, 153386, 184793, 222865, 267452

Offset: 1

Clark Kimberling, Mar 08 2012

nonn

a(n) = number of parts of odd multiplicity (each counted only once) in all partitions of n. Example: a(5) = 10 because we have [5'],[4',1'],[3',2'], [3',1,1],[2,2,1'],[2',1',1,1], and [1',1,1,1,1] (the 10 counted parts are marked). - Emeric Deutsch, Feb 08 2016

			The partitions of 5 are [5], [4,1], [3,2], [3,1,1], [2,2,1], [2,1,1,1], and [1,1,1,1,1], a total of 15 odd parts and 5 even parts, so that a(5)=10.

Vaclav Kotesovec, Table of n, a(n) for n = 1..10000 (terms 1..1000 from Alois P. Heinz)

Cf. A066897, A066898, A000041, A240009, A264398.

b:= proc(n, i) option remember; local m, f, g;
      m:= irem(i, 2);
      if n=0 then [1, 0, 0]
    elif i<1 then [0, 0, 0]
    else f:= b(n, i-1); g:= `if`(i>n, [0$3], b(n-i, i));
         [f[1]+g[1], f[2]+g[2]+m*g[1], f[3]+g[3]+(1-m)*g[1]]
      fi
    end:
a:= n-> b(n, n)[2] -b(n, n)[3]:
seq(a(n), n=1..50);  # Alois P. Heinz, Jul 09 2012
g := add(x^j/(1+x^j), j = 1 .. 80)/mul(1-x^j, j = 1 .. 80): gser := series(g, x = 0, 50): seq(coeff(gser, x, n), n = 0 .. 45); # Emeric Deutsch, Feb 08 2016

f[n_, i_] := Count[Flatten[IntegerPartitions[n]], i]
o[n_] := Sum[f[n, i], {i, 1, n, 2}]
e[n_] := Sum[f[n, i], {i, 2, n, 2}]
Table[o[n], {n, 1, 45}]  (* A066897 *)
Table[e[n], {n, 1, 45}]  (* A066898 *)
%% - %                   (* A209423 *)
b[n_, i_] := b[n, i] = Module[{m, f, g}, m = Mod[i, 2]; If[n==0, {1, 0, 0}, If[i<1, {0, 0, 0}, f = b[n, i-1]; g = If[i>n, {0, 0, 0}, b[n-i, i]]; {f[[1]] + g[[1]], f[[2]] + g[[2]] + m*g[[1]], f[[3]] + g[[3]] + (1-m)* g[[1]]}]]]; a[n_] := b[n, n][[2]] - b[n, n][[3]]; Table[a[n], {n, 1, 50}] (* Jean-François Alcover, Nov 16 2015, after Alois P. Heinz *)

a(n) = A066897(n) - A066898(n) = A206563(n,1) - A206563(n,2). - Omar E. Pol, Mar 08 2012
G.f.: Sum_{j>0} x^j/(1+x^j)/Product_{k>0}(1 - x^k). - Emeric Deutsch, Feb 08 2016
a(n) = Sum_{i=1..n} (-1)^(i + 1)*A181187(n, i). - John M. Campbell, Mar 18 2018
a(n) ~ log(2) * exp(Pi*sqrt(2*n/3)) / (2^(3/2) * Pi * sqrt(n)). - Vaclav Kotesovec, May 25 2018
For n > 0, a(n) = A305121(n) + A305123(n). - Vaclav Kotesovec, May 26 2018
a(n) = Sum_{k=-floor(n/2)+(n mod 2)..n} k * A240009(n,k). - Alois P. Heinz, Oct 23 2018
a(n) = Sum_{k>0} k * A264398(n,k). - Alois P. Heinz, Aug 05 2020

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

A206561 Triangle read by rows: T(n,k) = total sum of parts >= k in all partitions of n.

Original entry on oeis.org

1, 4, 2, 9, 5, 3, 20, 13, 7, 4, 35, 23, 15, 9, 5, 66, 47, 31, 19, 11, 6, 105, 75, 53, 35, 23, 13, 7, 176, 131, 93, 66, 42, 27, 15, 8, 270, 203, 151, 106, 74, 49, 31, 17, 9, 420, 323, 241, 178, 126, 86, 56, 35, 19, 10, 616, 477, 365, 272, 200, 140, 98, 63, 39, 21, 11

Offset: 1

Omar E. Pol, Feb 14 2012

From Omar E. Pol, Mar 18 2018: (Start)
In the n-th row of the triangle the first differences together with its last term give the n-th row of triangle A138785 (see below):
Row..........:  1     2       3            4               5          ...
               ---  ----   -------   ------------   ----------------
This triangle:  1;  4, 2;  9, 5, 3;  20, 13, 7, 4;  35, 23, 15, 9, 5; ...
                |   | /|   | /| /|    | / | /| /|    | / | / | /| /|
                |   |/ |   |/ |/ |    |/  |/ |/ |    |/  |/  |/ |/ |
A138785......:  1;  2, 2;  4, 2, 3;   7,  6, 3, 4;  12,  8,  6, 4, 5; ... (End)

			Triangle begins:
    1;
    4,  2;
    9,  5,  3;
   20, 13,  7,  4;
   35, 23, 15,  9,  5;
   66, 47, 31, 19, 11,  6;
  105, 75, 53, 35, 23, 13,  7;
  ...

Alois P. Heinz, Rows n = 1..141, flattened

Columns 1-2 give A066186, A194552.
Right border gives A000027.
Cf. A138785, A181187.
Row sums give A066183. - Omar E. Pol, Mar 19 2018
Both A180681 and A299768 have the same row sums as this triangle. - Omar E. Pol, Mar 21 2018

Table[With[{s = IntegerPartitions[n]}, Table[Total@ Flatten@ Map[Select[#, # >= k &] &, s], {k, n}]], {n, 11}] // Flatten (* Michael De Vlieger, Mar 19 2018 *)

T(n,n) = n, T(n,k) = T(n,k+1) + k * A066633(n,k) for k < n.

T(n,k) = Sum_{i=k..n} A138785(n,i).

More terms from Alois P. Heinz, Feb 14 2012

A096541 Number of parts unequal to 1 in all partitions of the integer n. Also the difference between the labeled and the unlabeled case of one-element transitions from the partitions of n to the partitions of n+1.

Original entry on oeis.org

0, 0, 1, 2, 5, 8, 16, 24, 41, 61, 95, 136, 204, 284, 407, 560, 779, 1050, 1432, 1901, 2543, 3338, 4393, 5698, 7411, 9513, 12226, 15562, 19803, 24993, 31538, 39506, 49456, 61546, 76499, 94603, 116858, 143679, 176431, 215802, 263576, 320796, 389900

Offset: 0

Thomas Wieder, Jun 24 2004

nonn

Also column 2 of A181187. - Omar E. Pol, Feb 18 2012

Sum over all partitions of n of the difference between the number of parts and the number of distinct parts. - Alois P. Heinz, Nov 18 2020

			The partitions of n=5 are [11111], [1112], [113], [122], [23], [14], [5] and they contain 0 + 1 + 1 + 2 + 2 + 1 + 1 = 8 = A096541(5) parts unequal to 1.

Alois P. Heinz, Table of n, a(n) for n = 0..1000

Cf. A066633, A093694, A093695, A094533, A006128, A339011.

main := proc(n::integer) local a,ndxp,ndxprt,ListOfPartitions,iverbose; with(combinat): ListOfPartitions:=partition(n); a:=0; for ndxp from 1 to nops(ListOfPartitions) do for ndxprt from 1 to nops(ListOfPartitions[ndxp]) do if op(ndxprt,ListOfPartitions[ndxp]) <> 1 then a := a + 1; fi; end do; end do; print("n, a(n):",n,a); end proc;
# second Maple program:
b:= proc(n, i) option remember; local f, g;
      if n=0 or i=1 then [1, 0]
    else f:= b(n, i-1); g:= `if`(i>n, [0, 0], b(n-i, i));
         [f[1]+g[1], f[2]+g[2]+g[1]]
      fi
    end:
a:= n-> b(n, n)[2]:
seq(a(n), n=0..60); # Alois P. Heinz, Apr 04 2012

f[n_] := Block[{l = Sort[ Flatten[ IntegerPartitions[n]]]}, Length[l] - Count[l, 1]]; Table[ f[n], {n, 0, 20}] (* Robert G. Wilson v, Jun 30 2004 *)
a[n_] := Sum[(DivisorSigma[0, k] - 1)*PartitionsP[n - k], {k, 1, n}]; Table[a[n], {n, 0, 42}] (* Jean-François Alcover, Jan 14 2013, after Vladeta Jovovic *)

a(n)=sum(k=1,n,(numdiv(k)-1)*numbpart(n-k)) \\ Charles R Greathouse IV, Jan 14 2013

a(n) = A093694(n) - A000070(n).
a(n) = Sum_{k=1..n} (tau(k)-1)*numbpart(n-k). - Vladeta Jovovic, Jun 26 2004
a(n) ~ exp(Pi*sqrt(2*n/3))*(2*gamma - 2 + log(6*n/Pi^2))/(4*Pi*sqrt(2*n)), where gamma is the Euler-Mascheroni constant A001620. - Vaclav Kotesovec, Oct 24 2016
a(n) = Sum_{i=1..floor(n/2)} A066633(n-i,i). - George Beck, Feb 15 2020
G.f.: Sum_{k>=1} x^(2*k)/(1 - x^k) / Product_{j>=1} (1 - x^j). - Ilya Gutkovskiy, Mar 05 2021

More terms from Robert G. Wilson v, Jun 30 2004

A208482 Triangle read by rows: T(n,k) = sum of positive k-th ranks of all partitions of n.

Original entry on oeis.org

0, 1, 1, 2, 1, 1, 4, 1, 2, 1, 7, 1, 3, 2, 1, 12, 2, 5, 4, 2, 1, 18, 3, 6, 6, 4, 2, 1, 29, 6, 9, 10, 7, 4, 2, 1, 42, 9, 11, 13, 11, 7, 4, 2, 1, 63, 16, 15, 19, 17, 12, 7, 4, 2, 1, 89, 24, 18, 25, 24, 18, 12, 7, 4, 2, 1, 128, 39, 24, 36, 34, 28, 19, 12, 7, 4, 2, 1

Offset: 1

Omar E. Pol, Mar 07 2012

For the definition of the k-th rank see A208478.
It appears that the sum of the k-th ranks of all partitions of n is equal to zero.
It appears that reversed rows converge to A000070, the same as A208478. - Omar E. Pol, Mar 10 2012

			For n = 4 the partitions of 4 and the four types of ranks of the partitions of 4 are
----------------------------------------------------------
Partitions    First      Second       Third      Fourth
of 4          rank        rank        rank        rank
----------------------------------------------------------
4           4-1 =  3    0-1 = -1    0-1 = -1    0-1 = -1
3+1         3-2 =  1    1-1 =  0    0-1 = -1    0-0 =  0
2+2         2-2 =  0    2-2 =  0    0-0 =  0    0-0 =  0
2+1+1       2-3 = -1    1-1 =  0    1-0 =  1    0-0 =  0
1+1+1+1     1-4 = -3    1-0 =  1    1-0 =  1    1-0 =  1
----------------------------------------------------------
The sums of positive k-th ranks of the partitions of 4 are 4, 1, 2, 1 so row 4 lists 4, 1, 2, 1.
Triangle begins:
0;
1,    1;
2,    1,  1;
4,    1,  2,  1;
7,    1,  3,  2,  1;
12,   2,  5,  4,  2,  1;
18,   3,  6,  6,  4,  2,  1;
29,   6,  9, 10,  7,  4,  2,  1;
42,   9, 11, 13, 11,  7,  4,  2,  1;
63,  16, 15, 19, 17, 12,  7,  4,  2,  1;
89,  24, 18, 25, 24, 18, 12,  7,  4,  2,  1;
128, 39, 24, 36, 34, 28, 19, 12,  7,  4,  2,  1;

Alois P. Heinz, Rows n = 1..44, flattened

Column 1 is A209616. Row sums give A208483.

Cf. A006128, A063995, A064173, A105805, A181187, A194547, A194549, A195822, A208478.

Terms a(1)-a(22) confirmed and additional terms added by John W. Layman, Mar 10 2012

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

A340031 Irregular triangle read by rows T(n,k) in which row n lists n blocks, where the m-th block consists of A000041(m-1) copies of the j-th row of triangle A127093, where j = n - m + 1 and 1 <= m <= n.

Original entry on oeis.org

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

Offset: 1

Omar E. Pol, Dec 26 2020

Another version of A338156 which is the main sequence with further information about the correspondence divisor/part.

			Triangle begins:
[1];
[1,2],      [1];
[1,0,3],    [1,2],    [1],    [1];
[1,2,0,4],  [1,0,3],  [1,2],  [1,2],  [1],  [1],  [1];
[1,0,0,0,5],[1,2,0,4],[1,0,3],[1,0,3],[1,2],[1,2],[1,2],[1],[1],[1],[1],[1];
[...
Written as an irregular tetrahedron the first five slices are:
[1],
-------
[1, 2],
[1],
----------
[1, 0, 3],
[1, 2],
[1],
[1];
-------------
[1, 2, 0, 4],
[1, 0, 3],
[1, 2],
[1, 2],
[1],
[1],
[1];
----------------
[1, 0, 0, 0, 5],
[1, 2, 0, 4],
[1, 0, 3],
[1, 0, 3],
[1, 2],
[1, 2],
[1, 2],
[1],
[1],
[1],
[1],
[1];
.
The following table formed by three zones shows the correspondence between divisors and parts (n = 1..5):
.
|---|---------|-----|-------|---------|-----------|-------------|
| n |         |  1  |   2   |    3    |     4     |      5      |
|---|---------|-----|-------|---------|-----------|-------------|
| P |         |     |       |         |           |             |
| A |         |     |       |         |           |             |
| R |         |     |       |         |           |             |
| T |         |     |       |         |           |  5          |
| I |         |     |       |         |           |  3 2        |
| T |         |     |       |         |  4        |  4 1        |
| I |         |     |       |         |  2 2      |  2 2 1      |
| O |         |     |       |  3      |  3 1      |  3 1 1      |
| N |         |     |  2    |  2 1    |  2 1 1    |  2 1 1 1    |
| S |         |  1  |  1 1  |  1 1 1  |  1 1 1 1  |  1 1 1 1 1  |
|---|---------|-----|-------|---------|-----------|-------------|
.
|---|---------|-----|-------|---------|-----------|-------------|
|   | A181187 |  1  |  3 1  |  6 2 1  | 12 5 2 1  | 20 8 4 2 1  |
| L |         |  |  |  |/|  |  |/|/|  |  |/|/|/|  |  |/|/|/|/|  |
| I | A066633 |  1  |  2 1  |  4 1 1  |  7 3 1 1  | 12 4 2 1 1  |
| N |         |  *  |  * *  |  * * *  |  * * * *  |  * * * * *  |
| K | A002260 |  1  |  1 2  |  1 2 3  |  1 2 3 4  |  1 2 3 4 5  |
|   |         |  =  |  = =  |  = = =  |  = = = =  |  = = = = =  |
|   | A138785 |  1  |  2 2  |  4 2 3  |  7 6 3 4  | 12 8 6 4 5  |
|---|---------|-----|-------|---------|-----------|-------------|
.
|---|---------|-----|-------|---------|-----------|-------------|
|   | A127093 |  1  |  1 2  |  1 0 3  |  1 2 0 4  |  1 0 0 0 5  |
|   |---------|-----|-------|---------|-----------|-------------|
|   | A127093 |     |  1    |  1 2    |  1 0 3    |  1 2 0 4    |
|   |---------|-----|-------|---------|-----------|-------------|
| D | A127093 |     |       |  1      |  1 2      |  1 0 3      |
| I | A127093 |     |       |  1      |  1 2      |  1 0 3      |
| V |---------|-----|-------|---------|-----------|-------------|
| I | A127093 |     |       |         |  1        |  1 2        |
| S | A127093 |     |       |         |  1        |  1 2        |
| O | A127093 |     |       |         |  1        |  1 2        |
| R |---------|-----|-------|---------|-----------|-------------|
| S | A127093 |     |       |         |           |  1          |
|   | A127093 |     |       |         |           |  1          |
|   | A127093 |     |       |         |           |  1          |
|   | A127093 |     |       |         |           |  1          |
|   | A127093 |     |       |         |           |  1          |
|---|---------|-----|-------|---------|-----------|-------------|
.
The table is essentially the same table of A338156 but here, in the lower zone, every row is A127093 instead of A027750.
.

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

Row sums give A066186.
Nonzero terms gives A338156.
Cf. A000070, A000041, A002260, A026792, A027750, A058399, A066633, A127093, A135010, A138121, A138785, A176206, A181187, A182703, A207031, A207383, A211992, A221529, A221530, A221531, A221649, A221650, A237593, A245095, A302246, A302247, A336811, A337209,  A339106, A339258, A339278, A339304, A340011, A340032, A340035, A340061.

A127093row[n_]:=Table[Boole[Divisible[n,k]]k,{k,n}];
A340031row[n_]:=Flatten[Table[ConstantArray[A127093row[n-m+1],PartitionsP[m-1]],{m,n}]];
Array[A340031row,7] (* Paolo Xausa, Sep 28 2023 *)

cp's OEIS Frontend

A024792 Number of 8's in all partitions of n.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Maple

Mathematica

Formula

A024793 Number of 9's in all partitions of n.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Maple

Mathematica

Formula

A208478 Triangle read by rows: T(n,k) = number of partitions of n with positive k-th rank.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Extensions

A209423 Difference between the number of odd parts and the number of even parts in all the partitions of n.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

Formula

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

A206561 Triangle read by rows: T(n,k) = total sum of parts >= k in all partitions of n.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Formula

Extensions

A096541 Number of parts unequal to 1 in all partitions of the integer n. Also the difference between the labeled and the unlabeled case of one-element transitions from the partitions of n to the partitions of n+1.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

PARI

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