A024794 -id:A024794 - cp's OEIS frontend

A066633 Triangle T(n,k), n >= 1, 1 <= k <= n, giving number of k's in all partitions of n.

1, 2, 1, 4, 1, 1, 7, 3, 1, 1, 12, 4, 2, 1, 1, 19, 8, 4, 2, 1, 1, 30, 11, 6, 3, 2, 1, 1, 45, 19, 9, 6, 3, 2, 1, 1, 67, 26, 15, 8, 5, 3, 2, 1, 1, 97, 41, 21, 13, 8, 5, 3, 2, 1, 1, 139, 56, 31, 18, 12, 7, 5, 3, 2, 1, 1, 195, 83, 45, 28, 17, 12, 7, 5, 3, 2, 1, 1, 272, 112, 63, 38, 25, 16, 11, 7, 5, 3, 2, 1, 1

Offset: 1

Naohiro Nomoto, Jan 09 2002

It appears that row n lists the first differences of the row n of triangle A181187 together with 1 (as the final term of the row n). - Omar E. Pol, Feb 26 2012
It appears that reversed rows converge to A000041. - Omar E. Pol, Mar 11 2012
Proof: For a partition of n with k>floor(n/2+1), k can only occur as the largest part; the other parts sum to n-k, so that T(n,n-k)=A000041(k). - George Beck, Jun 30 2019
T(n,k) is also the total number k's that are 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. - Omar E. Pol, Feb 05 2021

			For n = 3, k = 1; 3 = 2+1 = 1+1+1. T(3,1) = (zero 1's) + (one 1's) + (three 1's), so T(3,1) = 4.
Triangle begins:
    1;
    2,   1;
    4,   1,  1;
    7,   3,  1,  1;
   12,   4,  2,  1,  1;
   19,   8,  4,  2,  1,  1;
   30,  11,  6,  3,  2,  1,  1;
   45,  19,  9,  6,  3,  2,  1, 1;
   67,  26, 15,  8,  5,  3,  2, 1, 1;
   97,  41, 21, 13,  8,  5,  3, 2, 1, 1;
  139,  56, 31, 18, 12,  7,  5, 3, 2, 1, 1;
  195,  83, 45, 28, 17, 12,  7, 5, 3, 2, 1, 1;
  272, 112, 63, 38, 25, 16, 11, 7, 5, 3, 2, 1, 1;
  ...

D. E. Knuth, The Art of Computer Programming, Vol. 4A, Section 7.2.1.5, Problem 73(b), pp. 415, 761. - N. J. A. Sloane, Dec 30 2018

Alois P. Heinz, Rows n = 1..141, flattened
Manosij Ghosh Dastidar and Sourav Sen Gupta, Generalization of a few results in Integer Partitions, arXiv preprint arXiv:1111.0094 [cs.DM], 2011.
Joseph Vandehey, Digital problems in the theory of partitions, Integers (2024) Vol. 24A, Art. No. A18. See p. 3.
Eric Weisstein's World of Mathematics, Elder's Theorem

Row sums give positive terms of A006128.

Columns (1-10): A000070, A024786-A024794.

b:= proc(n, i) option remember;
      `if`(n=0 or i=1, 1+n*x, b(n, i-1)+
      `if`(i>n, 0, (g->g+coeff(g, x, 0)*x^i)(b(n-i, i))))
    end:
T:= n-> (p->seq(coeff(p, x, i), i=1..n))(b(n, n)):
seq(T(n), n=1..14);  # Alois P. Heinz, Mar 21 2012

Table[Count[Flatten[IntegerPartitions[n]],k],
{n,1,20},{k,1,n}]
TableForm[% ] (* as a triangle *)
Flatten[%%]   (* as a sequence *)
(* Clark Kimberling, Mar 03 2010 *)
T[n_, n_] = 1; T[n_, k_] /; k, ] = 0; Table[T[n, k], {n, 1, 14}, {k, 1, n}] // Flatten (* Jean-François Alcover, Sep 21 2015, after Omar E. Pol *)

from math import isqrt, comb
from sympy import partition
def A066633(n):
    a = (m:=isqrt(k:=n<<1))+(k>m*(m+1))
    b = n-comb(a,2)
    return sum(partition(j) for j in range(a%b,a,b)) # Chai Wah Wu, Nov 13 2024

G.f. for the number of k's in all partitions of n is x^k/(1-x^k)* Product_{m>=1} 1/(1-x^m). - Vladeta Jovovic, Jan 15 2002

T(n, k) = Sum_{j

Equals triangle A027293 * A051731 as infinite lower triangular matrices. - Gary W. Adamson Mar 21 2011

It appears that T(n+k,k) = T(n,k) + A000041(n). - Omar E. Pol, Feb 04 2012. This was proved in the Dastidar-Gupta paper in Lemma 1. - George Beck, Jun 26 2019

It appears that T(n,k) = A206563(n,k) - A206563(n,k+2). - Omar E. Pol, Feb 26 2012

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

More terms from Vladeta Jovovic, Jan 11 2002

A024786 Number of 2's in all partitions of n.

Original entry on oeis.org

0, 1, 1, 3, 4, 8, 11, 19, 26, 41, 56, 83, 112, 160, 213, 295, 389, 526, 686, 911, 1176, 1538, 1968, 2540, 3223, 4115, 5181, 6551, 8191, 10269, 12756, 15873, 19598, 24222, 29741, 36532, 44624, 54509, 66261, 80524, 97446, 117862, 142029, 171036, 205290, 246211

Offset: 1

Clark Kimberling

nonn

Also number of partitions of n-1 with a distinguished part different from all the others. [Comment corrected by Emeric Deutsch, Aug 13 2008]
In general the number of times that j appears in the partitions of n equals Sum_{kA024787, ..., A024794, for j = 2,...,10; it generalizes the formula given for A000070 for j=1. - Jose Luis Arregui (arregui(AT)posta.unizar.es), Apr 05 2002
Equals row sums of triangle A173238. - Gary W. Adamson, Feb 13 2010
The sums of two successive terms give A000070. - Omar E. Pol, Jul 12 2012
a(n) is also the difference between the sum of second largest and the sum of third largest elements in all partitions of n. More generally, the number of occurrences of k in all partitions of n equals the difference between the sum of k-th largest and the sum of (k+1)st largest elements in all partitions of n. And more generally, the sum of the number of occurrences of k, k+1, k+2..k+m in all partitions of n equals the difference between the sum of k-th largest and the sum of (k+m+1)st largest elements in all partitions of n. - Omar E. Pol, Oct 25 2012
Number of singletons in all partitions of n-1. A singleton in a partition is a part that occurs exactly once. Example: a(5) = 4 because in the partitions of 4, namely [1,1,1,1], [1,1,2'], [2,2], [1',3'], [4'] we have 4 singletons (marked by '). - Emeric Deutsch, Sep 12 2016
a(n) is also the number of non-isomorphic vertex-transitive cover graphs of lattice quotients of essential lattice congruences of the weak order on the symmetric group S_{n-1}. See Table 1 in the Hoang/Mütze reference in the Links section. - Torsten Muetze, Nov 28 2019
Assuming a partition is in weakly decreasing order, a(n) is also the number of times -1 occurs in the differences of the partitions of n+1. - George Beck, Mar 28 2023

			From _Omar E. Pol_, Oct 25 2012: (Start)
For n = 7 we have:
--------------------------------------
.                             Number
Partitions of 7               of 2's
--------------------------------------
7 .............................. 0
4 + 3 .......................... 0
5 + 2 .......................... 1
3 + 2 + 2 ...................... 2
6 + 1 .......................... 0
3 + 3 + 1 ...................... 0
4 + 2 + 1 ...................... 1
2 + 2 + 2 + 1 .................. 3
5 + 1 + 1 ...................... 0
3 + 2 + 1 + 1 .................. 1
4 + 1 + 1 + 1 .................. 0
2 + 2 + 1 + 1 + 1 .............. 2
3 + 1 + 1 + 1 + 1 .............. 0
2 + 1 + 1 + 1 + 1 + 1 .......... 1
1 + 1 + 1 + 1 + 1 + 1 + 1 ...... 0
------------------------------------
.  24 - 13 =                    11
.
The difference between the sum of the second column and the sum of the third column of the set of partitions of 7 is 24 - 13 = 11 and equals the number of 2's in all partitions of 7, so a(7) = 11.
(End)

J. Riordan, Combinatorial Identities, Wiley, 1968, p. 184.

Alois P. Heinz and Vaclav Kotesovec, Table of n, a(n) for n = 1..10000 (terms 1..1000 from Alois P. Heinz)
David Benson, Radha Kessar, and Markus Linckelmann, Hochschild cohomology of symmetric groups in low degrees, arXiv:2204.09970 [math.GR], 2022.
Philip Cuthbertson, Fixed hooks in arbitrary columns of partitions, Integers (2025) Vol. 25, Art. No. A28. See p. 3.
Manosij Ghosh Dastidar and Sourav Sen Gupta, Generalization of a few results in Integer Partitions, arXiv preprint arXiv:1111.0094 [cs.DM], 2011.
Emeric Deutsch et al., Problem 11237, Amer. Math. Monthly, 115 (No. 7, 2008), 666-667. [From _Emeric Deutsch_, Aug 13 2008]
Hung Phuc Hoang and Torsten Mütze, Combinatorial generation via permutation languages. II. Lattice congruences, arXiv:1911.12078 [math.CO], 2019.
Joseph Vandehey, Digital problems in the theory of partitions, Integers (2024) Vol. 24A, Art. No. A18. See p. 3.

Cf. A066633, A024787, A024788, A024789, A024790, A024791, A024792, A024793, A024794, A173238.
Column 2 of A060244.
First differences of A000097.

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$2], b(n-i, i));
         [f[1]+g[1], f[2]+g[2]+`if`(i=2, g[1], 0)]
      fi
    end:
a:= n-> b(n, n)[2]:
seq(a(n), n=1..50);  # Alois P. Heinz, May 18 2012

Table[ Count[ Flatten[ IntegerPartitions[n]], 2], {n, 1, 50} ]
(* Second program: *)
b[n_, i_] := b[n, i] = Module[{f, g}, If[n==0 || i==1, {1, 0}, f = b[n, i - 1]; g = If[i>n, {0, 0}, b[n-i, i]]; {f[[1]] + g[[1]], f[[2]] + g[[2]] + If[i == 2, g[[1]], 0]}]]; a[n_] := b[n, n][[2]]; Table[a[n], {n, 1, 50}] (* Jean-François Alcover, Sep 22 2015, after Alois P. Heinz *)
Join[{0}, (1/((1 - x^2) QPochhammer[x]) + O[x]^50)[[3]]] (* Vladimir Reshetnikov, Nov 22 2016 *)
Table[Sum[(1 + (-1)^k)/2 * PartitionsP[n-k], {k, 2, n}], {n, 1, 50}] (* Vaclav Kotesovec, Aug 27 2017 *)

from sympy import npartitions
def A024786(n): return sum(npartitions(n-(k<<1)) for k in range(1,(n>>1)+1)) # Chai Wah Wu, Oct 25 2023

a(n) = Sum_{k=1..floor(n/2)} A000041(n-2k). - Christian G. Bower, Jun 22 2000
a(n) = Sum_{kA000041, P(0) = 1. - Jose Luis Arregui (arregui(AT)posta.unizar.es), Apr 05 2002
G.f.: (x^2/((1-x)*(1-x^2)^2))*Product_{j>=3} 1/(1-x^j) from Riordan reference second term, last eq.
a(n) = A006128(n-1) - A194452(n-1). - Omar E. Pol, Nov 20 2011
a(n) = A181187(n,2) - A181187(n,3). - Omar E. Pol, Oct 25 2012
a(n) ~ exp(Pi*sqrt(2*n/3)) / (2^(5/2) * Pi * sqrt(n)) * (1 - 25*Pi/(24*sqrt(6*n)) + (25/48 + 433*Pi^2/6912)/n). - Vaclav Kotesovec, Mar 07 2016, extended Nov 05 2016
a(n) = Sum_{k} k * A116595(n-1,k). - Emeric Deutsch, Sep 12 2016
G.f.: x^2/((1 - x)*(1 - x^2)) * Sum_{n >= 0} x^(2*n)/( Product_{k = 1..n} 1 - x^k ); that is, convolution of A004526 (partitions into 2 parts, or, modulo offset differences, partitions into parts <= 2) and A002865 (partitions into parts >= 2). - Peter Bala, Jan 17 2021

A024788 Number of 4's in all partitions of n.

Original entry on oeis.org

0, 0, 0, 1, 1, 2, 3, 6, 8, 13, 18, 28, 38, 55, 74, 105, 139, 190, 250, 336, 436, 575, 740, 963, 1228, 1577, 1995, 2538, 3186, 4013, 5005, 6256, 7751, 9617, 11847, 14605, 17894, 21927, 26730, 32582, 39531, 47942, 57915, 69920, 84114, 101116, 121176, 145095, 173248

Offset: 1

Clark Kimberling

The sums of four successive terms give A000070. - Omar E. Pol, Jul 12 2012
a(n) is also the difference between the sum of 4th largest and the sum of 5th largest elements in all partitions of n. - Omar E. Pol, Oct 25 2012
a(n+4) is the number of n-vertex graphs that do not contain a triangle, P_4, or K_2,3 as induced subgraph. These are the K_2,3-free bipartite cographs. Bipartite cographs are graph that are disjoint unions of complete bipartite graphs [Babel et al. Corollary 2.2], and forbidding K_2,3 leaves one possible component for each size except size 4, where there are two. Thus, this number is A000041(n) + a(n) = a(n+4). - Falk Hüffner, Jan 11 2016
a(n) (n>=3) is the number of even singletons in all partitions of n-2 (by a singleton we mean a part that occurs exactly once). Example: a(7) = 3 because in the partitions [5], [4*,1], [3,2*], [3,1,1], [2,2,1], [2*,1,1,1], [1,1,1,1,1] we have 3 even singletons (marked by *). The statement of this comment can be obtained by setting k=2 in Theorem 2 of the Andrews et al. reference. - Emeric Deutsch, Sep 13 2016

			From _Omar E. Pol_, Oct 25 2012: (Start)
For n = 7 we have:
--------------------------------------
.                             Number
Partitions of 7               of 4's
--------------------------------------
7 .............................. 0
4 + 3 .......................... 1
5 + 2 .......................... 0
3 + 2 + 2 ...................... 0
6 + 1 .......................... 0
3 + 3 + 1 ...................... 0
4 + 2 + 1 ...................... 1
2 + 2 + 2 + 1 .................. 0
5 + 1 + 1 ...................... 0
3 + 2 + 1 + 1 .................. 0
4 + 1 + 1 + 1 .................. 1
2 + 2 + 1 + 1 + 1 .............. 0
3 + 1 + 1 + 1 + 1 .............. 0
2 + 1 + 1 + 1 + 1 + 1 .......... 0
1 + 1 + 1 + 1 + 1 + 1 + 1 ...... 0
------------------------------------
.           7 - 4 =              3
The difference between the sum of the fourth column and the sum of the fifth column of the set of partitions of 7 is 7 - 4 = 3 and equals the number of 4's in all partitions of 7, so a(7) = 3.
(End)

Alois P. Heinz, Table of n, a(n) for n = 1..1000
G. E. Andrews and E. Deutsch, A note on a method of Erdos and the Stanley-Elder theorems, Integers, 16 (2016), A24.
L. Babel, A. Brandstädt, and V. B. Le, Recognizing the P4-structure of bipartite graphs, Discrete Appl. Math. 93 (1999), 157-168.
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, A024789, A024790, A024791, A024792, A024793, A024794.

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$2], b(n-i, i));
         [f[1]+g[1], f[2]+g[2]+`if`(i=4, 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]], 4], {n, 1, 50} ]
(* 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 == 4, 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,4) - A181187(n,5). - Omar E. Pol, Oct 25 2012
From Peter Bala, Dec 26 2013: (Start)
a(n+4) - a(n) = A000041(n). a(n) + a(n+2) = A024786(n).
O.g.f.: x^4/(1 - x^4) * product {k >= 1} 1/(1 - x^k) = x^4 + x^5 + 2*x^6 + 3*x^7 + ....
Asymptotic result: log(a(n)) ~ 2*sqrt(Pi^2/6)*sqrt(n) as n -> inf. (End)
a(n) ~ exp(Pi*sqrt(2*n/3)) / (8*Pi*sqrt(2*n)) * (1 - 49*Pi/(24*sqrt(6*n)) + (49/48 + 1633*Pi^2/6912)/n). - Vaclav Kotesovec, Nov 05 2016
G.f.: x^4/((1 - x)*(1 - x^2)*(1 - x^3)*(1 - x^4)) * Sum_{n >= 0} x^(4*n)/( Product_{k = 1..n} 1 - x^k ); that is, convolution of A026810 (partitions into 4 parts, or, modulo offset differences, partitions into parts <= 4) and A008484 (partitions into parts >= 4). - Peter Bala, Jan 17 2021

A024787 Number of 3's in all partitions of n.

Original entry on oeis.org

0, 0, 1, 1, 2, 4, 6, 9, 15, 21, 31, 45, 63, 87, 122, 164, 222, 298, 395, 519, 683, 885, 1146, 1475, 1887, 2401, 3050, 3845, 4837, 6060, 7563, 9402, 11664, 14405, 17751, 21807, 26715, 32634, 39784, 48352, 58649, 70969, 85690, 103232, 124143, 148951, 178407, 213277, 254509

Offset: 1

Clark Kimberling

Starting with the first 1 = row sums of triangle A173239. - Gary W. Adamson, Feb 13 2010
The sums of three successive terms give A000070. - Omar E. Pol, Jul 12 2012
a(n) is also the difference between the sum of 3rd largest and the sum of 4th largest elements in all partitions of n. - Omar E. Pol, Oct 25 2012

			From _Omar E. Pol_, Oct 25 2012: (Start)
For n = 7 we have:
--------------------------------------
.                             Number
Partitions of 7               of 3's
--------------------------------------
7 .............................. 0
4 + 3 .......................... 1
5 + 2 .......................... 0
3 + 2 + 2 ...................... 1
6 + 1 .......................... 0
3 + 3 + 1 ...................... 2
4 + 2 + 1 ...................... 0
2 + 2 + 2 + 1 .................. 0
5 + 1 + 1 ...................... 0
3 + 2 + 1 + 1 .................. 1
4 + 1 + 1 + 1 .................. 0
2 + 2 + 1 + 1 + 1 .............. 0
3 + 1 + 1 + 1 + 1 .............. 1
2 + 1 + 1 + 1 + 1 + 1 .......... 0
1 + 1 + 1 + 1 + 1 + 1 + 1 ...... 0
------------------------------------
.      13 - 7 =                  6
The difference between the sum of the third column and the sum of the fourth column of the set of partitions of 7 is 13 - 7 = 6 and equals the number of 3's in all partitions of 7, so a(7) = 6.
(End)

Alois P. Heinz, Table of n, a(n) for n = 1..5000
David Benson, Radha Kessar, and Markus Linckelmann, Hochschild cohomology of symmetric groups in low degrees, arXiv:2204.09970 [math.GR], 2022.
Philip Cuthbertson, Fixed hooks in arbitrary columns of partitions, Integers (2025) Vol. 25, Art. No. A28. See p. 3.
Eric Weisstein's World of Mathematics, q-Pochhammer Symbol

Cf. A066633, A024786, A024788, A024789, A024790, A024791, A024792, A024793, A024794, A263232.

Cf. A173239. - Gary W. Adamson, Feb 13 2010

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=3, 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]], 3], {n, 1, 50} ]
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==3, 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 *)
Join[{0, 0}, (1/((1 - x^3) QPochhammer[x]) + O[x]^50)[[3]]] (* Vladimir Reshetnikov, Nov 22 2016 *)

a(n) = A181187(n,3) - A181187(n,4). - Omar E. Pol, Oct 25 2012
a(n) = Sum_{k=1..floor(n/3)} A263232(n,k). - Alois P. Heinz, Nov 01 2015
a(n) ~ exp(Pi*sqrt(2*n/3)) / (6*Pi*sqrt(2*n)) * (1 - 37*Pi/(24*sqrt(6*n)) + (37/48 + 937*Pi^2/6912)/n). - Vaclav Kotesovec, Nov 05 2016
G.f.: x^2/((1 - x^3)*(x)inf), where (q)_inf is the q-Pochhammer symbol (the Euler function). - _Vladimir Reshetnikov, Nov 22 2016
G.f.: x^3/((1 - x)*(1 - x^2)*(1 - x^3)) * Sum_{n >= 0} x^(3*n)/( Product_{k = 1..n} 1 - x^k ); that is, convolution of A069905 (partitions into 3 parts, or, modulo offset differences, partitions into parts <= 3) and A008483 (partitions into parts >= 3). - Peter Bala, Jan 17 2021

A024789 Number of 5's in all partitions of n.

Original entry on oeis.org

0, 0, 0, 0, 1, 1, 2, 3, 5, 8, 12, 17, 25, 35, 50, 68, 94, 126, 170, 226, 299, 391, 511, 660, 853, 1091, 1393, 1766, 2235, 2811, 3527, 4403, 5484, 6800, 8415, 10369, 12752, 15627, 19110, 23298, 28346, 34389, 41642, 50295, 60636, 72929, 87563, 104903, 125470

Offset: 1

Clark Kimberling

nonn

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

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

			From _Omar E. Pol_, Oct 25 2012: (Start)
For n = 8 we have:
--------------------------------------
.                             Number
Partitions of 8               of 5's
--------------------------------------
8 .............................. 0
4 + 4 .......................... 0
5 + 3 .......................... 1
6 + 2 .......................... 0
3 + 3 + 2 ...................... 0
4 + 2 + 2 ...................... 0
2 + 2 + 2 + 2 .................. 0
7 + 1 .......................... 0
4 + 3 + 1 ...................... 0
5 + 2 + 1 ...................... 1
3 + 2 + 2 + 1 .................. 0
6 + 1 + 1 ...................... 0
3 + 3 + 1 + 1 .................. 0
4 + 2 + 1 + 1 .................. 0
2 + 2 + 2 + 1 + 1 .............. 0
5 + 1 + 1 + 1 .................. 1
3 + 2 + 1 + 1 + 1 .............. 0
4 + 1 + 1 + 1 + 1 .............. 0
2 + 2 + 1 + 1 + 1 + 1 .......... 0
3 + 1 + 1 + 1 + 1 + 1 .......... 0
2 + 1 + 1 + 1 + 1 + 1 + 1 ...... 0
1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 .. 0
------------------------------------
.               7 - 4 =          3
The difference between the sum of the fifth column and the sum of the sixth column of the set of partitions of 8 is 7 - 4 = 3 and equals the number of 5's in all partitions of 8, so a(8) = 3.
(End)

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. A066633, A024786, A024787, A024788, A024790, A024791, A024792, 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=5, 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]], 5], {n, 1, 50} ]
(* 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 == 5, 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 *)

x='x+O('x^50); concat([0, 0, 0, 0], Vec(x^5/(1 - x^5) * prod(k=1, 50, 1/(1 - x^k)))) \\ Indranil Ghosh, Apr 06 2017

a(n) = A181187(n,5) - A181187(n,6). - Omar E. Pol, Oct 25 2012
a(n) ~ exp(Pi*sqrt(2*n/3)) / (10*Pi*sqrt(2*n)) * (1 - 61*Pi/(24*sqrt(6*n)) + (61/48 + 2521*Pi^2/6912)/n). - Vaclav Kotesovec, Nov 05 2016
G.f.: x^5/(1 - x^5) * Product_{k>=1} 1/(1 - x^k). - Ilya Gutkovskiy, Apr 06 2017

A024790 Number of 6's in all partitions of n.

Original entry on oeis.org

0, 0, 0, 0, 0, 1, 1, 2, 3, 5, 7, 12, 16, 24, 33, 47, 63, 89, 117, 159, 209, 278, 360, 474, 607, 786, 1001, 1280, 1615, 2049, 2565, 3222, 4011, 4998, 6180, 7653, 9407, 11571, 14154, 17308, 21063, 25630, 31044, 37586, 45339, 54646, 65646, 78804, 94305, 112761, 134473

Offset: 1

Clark Kimberling

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

a(n) is also the difference between the sum of 6th largest and the sum of 7th 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, A024791, A024792, 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=6, 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]], 6], {n, 1, 52} ]
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 == 6, 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,6) - A181187(n,7). - Omar E. Pol, Oct 25 2012
From Peter Bala, Dec 26 2013: (Start)
a(n+6) - a(n) = A000041(n). a(n) + a(n+3) = A024787(n).
a(n) + a(n+2) + a(n+4) = A024786(n).
O.g.f.: x^6/(1 - x^6) * product {k >= 1} 1/(1 - x^k) = x^6 + x^7 + 2*x^8 + 3*x^9 + ....
Asymptotic result: log(a(n)) ~ 2*sqrt(Pi^2/6)*sqrt(n) as n -> inf. (End)
a(n) ~ exp(Pi*sqrt(2*n/3)) / (12*Pi*sqrt(2*n)) * (1 - 73*Pi/(24*sqrt(6*n)) + (73/48 + 3601*Pi^2/6912)/n). - Vaclav Kotesovec, Nov 05 2016

A024791 Number of 7's in all partitions of n.

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 1, 1, 2, 3, 5, 7, 11, 16, 23, 32, 45, 61, 84, 112, 151, 199, 263, 342, 446, 574, 739, 943, 1201, 1518, 1917, 2404, 3010, 3749, 4661, 5766, 7122, 8759, 10753, 13153, 16059, 19544, 23743, 28759, 34774, 41938, 50491, 60642, 72718, 87004, 103934, 123908

Offset: 1

Clark Kimberling

nonn

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

a(n) is also the difference between the sum of 7th largest and the sum of 8th 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. A066633, A024786, A024787, A024788, A024789, A024790, A024792, 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=7, g[1], 0)]
      fi
    end:
a:= n-> b(n, n)[2]:
seq(a(n), n=1..100);  # Alois P. Heinz, Oct 27 2012

<< DiscreteMath`Combinatorica`; Table[ Count[ Flatten[ Partitions[n]], 7], {n, 1, 52} ]
Table[Count[Flatten[IntegerPartitions[n]],7],{n,55}] (* Harvey P. Dale, Feb 26 2015 *)
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 == 7, 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 *)

x='x+O('x^50); concat([0, 0, 0, 0, 0, 0], Vec(x^7/(1 - x^7) * prod(k=1, 50, 1/(1 - x^k)))) \\ Indranil Ghosh, Apr 06 2017

a(n) = A181187(n,7) - A181187(n,8). - Omar E. Pol, Oct 25 2012
a(n) ~ exp(Pi*sqrt(2*n/3)) / (14*Pi*sqrt(2*n)) * (1 - 85*Pi/(24*sqrt(6*n)) + (85/48 + 4873*Pi^2/6912)/n). - Vaclav Kotesovec, Nov 05 2016
G.f.: x^7/(1 - x^7) * Product_{k>=1} 1/(1 - x^k). - Ilya Gutkovskiy, Apr 06 2017

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

Original entry on oeis.org

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

A206560 Number of 10's in the last section of the set of partitions of n.

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 2, 2, 4, 4, 7, 8, 13, 14, 22, 25, 36, 43, 59, 70, 95, 113, 150, 179, 232, 278, 356, 426, 537, 644, 803, 960, 1189, 1417, 1739, 2072, 2523, 2999, 3631, 4304, 5181, 6130, 7342, 8662, 10330, 12159, 14437, 16958

Offset: 1

Omar E. Pol, Feb 09 2012

nonn

Zero together with the first differences of A024794. Also number of occurrences of 10 in all partitions of n that do not contain 1 as a part. For the definition of "last section of n" see A135010. It appears that the sums of ten successive terms give the partition numbers A000041.

Column 10 of A182703 and of A194812.

Cf. A000041, A135010, A138121, A182712-A182714, A206555-A206559.

A206560 = lambda n: sum(list(p).count(10) for p in Partitions(n) if 1 not in p)

It appears that A000041(n) = Sum_{j=1..10} a(n+j), n >= 0.

Showing 1-10 of 12 results. Next

cp's OEIS Frontend

A066633 Triangle T(n,k), n >= 1, 1 <= k <= n, giving number of k's in all partitions of n.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Maple

Mathematica

Python

Formula

Extensions

A024786 Number of 2's in all partitions of n.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Maple

Mathematica

Python

Formula

A024788 Number of 4's in all partitions of n.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

Formula

A024787 Number of 3's in all partitions of n.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

Formula

A024789 Number of 5's in all partitions of n.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Formula

A024790 Number of 6's in all partitions of n.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Maple

Mathematica

Formula

A024791 Number of 7's in all partitions of n.

Views