A116645 -id:A116645 - cp's OEIS frontend

A229816 Number of partitions of n such that if the length is k then k is not a part.

1, 0, 2, 2, 4, 5, 9, 11, 18, 23, 34, 44, 63, 80, 111, 142, 190, 242, 319, 402, 522, 655, 837, 1045, 1322, 1638, 2053, 2532, 3144, 3857, 4757, 5803, 7111, 8636, 10516, 12716, 15404, 18543, 22355, 26807, 32168, 38430, 45929, 54670, 65088, 77220, 91599, 108330, 128077, 151006, 177974

Offset: 0

Jon Perry, Sep 30 2013

nonn

For example with n=5 neither 32 or 311 are allowed.

Conjecture: Also, for n>=1, a(n-1) is the total number of distinct parts of each partition of 2n with partition rank n. - George Beck, Jun 23 2019

			a(2) = 2 : 2, 11.
a(6) = 9 : 6, 51, 411, 33, 3111, 222, 2211, 21111, 111111.

Alois P. Heinz, Table of n, a(n) for n = 0..1000
Atul Dixit, Gaurav Kumar, and Aviral Srivastava, Non-Rascoe partitions and a rank parity function associated to the Rogers-Ramanujan partitions, arXiv:2508.04359 [math.CO], 2025. See references.

Cf. A116645.
Cf. A002865 (partitions where the number of parts is itself a part).
Cf. A000041, A002865.

b:= proc(n, i, t) option remember; `if`(n=0, 1, `if`(in, 0, b(n-i, i, t))))
    end:
a:= n-> b(n$2, 1)-b((n-1)$2, 2):
seq(a(n), n=0..60);  # Alois P. Heinz, Sep 30 2013

nn=50;CoefficientList[Series[ Product[1/(1-x^i),{i,1,nn}]-x Product[1/(1-x^i),{i,2,nn}],{x,0,nn}],x] (* Geoffrey Critzer, Sep 30 2013 *)
Table[PartitionsP[n] - (PartitionsP[n - 1] - PartitionsP[n - 2]), {n, 0, 60}] (* Vincenzo Librandi, Jun 30 2019 *)

N=66;  x='x+O('x^N);
gf = 1/eta(x) - x*(1-x)/eta(x);
Vec( gf )
\\ Joerg Arndt, Sep 30 2013

From Joerg Arndt, Sep 30 2013: (Start)
a(n) = A000041(n) - A002865(n-1), n>=1.
G.f.: 1/E(x) - x*(1-x)/E(x) where E(x) = Product_{k>=1} 1-x^k. (End)

Corrected a(8) and extended beyond a(9), Joerg Arndt, Sep 30 2013

A183568 Triangle T(n,k), n>=0, 0<=k<=n, read by rows: T(n,k) is the number of partitions of n containing a clique of size k.

Original entry on oeis.org

1, 1, 1, 2, 1, 1, 3, 2, 0, 1, 5, 3, 2, 0, 1, 7, 6, 2, 1, 0, 1, 11, 7, 3, 2, 1, 0, 1, 15, 13, 5, 3, 1, 1, 0, 1, 22, 16, 9, 3, 3, 1, 1, 0, 1, 30, 25, 10, 6, 3, 2, 1, 1, 0, 1, 42, 33, 16, 8, 5, 3, 2, 1, 1, 0, 1, 56, 49, 23, 13, 6, 5, 2, 2, 1, 1, 0, 1, 77, 61, 31, 15, 10, 5, 5, 2, 2, 1, 1, 0, 1

Offset: 0

Alois P. Heinz, Jan 05 2011

All parts of a number partition with the same value form a clique. The size of a clique is the number of elements in the clique. Each partition has a clique of size 0.

			T(5,2) = 2, because 2 (of 7) partitions of 5 contain (at least) one clique of size 2: [1,2,2], [1,1,3].
Triangle T(n,k) begins:
   1;
   1,  1;
   2,  1, 1;
   3,  2, 0, 1;
   5,  3, 2, 0, 1;
   7,  6, 2, 1, 0, 1;
  11,  7, 3, 2, 1, 0, 1;
  15, 13, 5, 3, 1, 1, 0, 1;

Alois P. Heinz, Rows n = 0..140, flattened

Columns k=0-10 give: A000041, A183558, A183559, A183560, A183561, A183562, A183563, A183564, A183565, A183566, A183567.
Differences between columns 0 and k (0A007690, A116645, A118807, A184639, A184640, A184641, A184642, A184643, A184644, A184645.
T(2*k+1,k+1) gives A002865.

b:= proc(n, i, k) option remember; `if`(n=0, [1, 0], `if`(i<1, [0, 0],
      add((l->`if`(j=k, [l[1]$2], l))(b(n-i*j, i-1, k)), j=0..n/i)))
    end:
T:= (n, k)-> (l-> l[`if`(k=0, 1, 2)])(b(n, n, k)):
seq(seq(T(n, k), k=0..n), n=0..12);

b[n_, i_, k_] := b[n, i, k] = If[n == 0, {1, 0}, If[i < 1, {0, 0}, Sum[Function[l, If[j == k, {l[[1]], l[[1]]}, l]][b[n - i*j, i-1, k]], {j, 0, n/i}]] ]; t[n_, k_] := Function[l, l[[If[k == 0, 1, 2]]]][b[n, n, k]]; Table[Table[t[n, k], {k, 0, n}], {n, 0, 12}] // Flatten (* Jean-François Alcover, Dec 16 2013, translated from Maple *)

G.f. of column k: (1-Product_{j>0} (1-x^(k*j)+x^((k+1)*j))) / (Product_{j>0} (1-x^j)).

A118807 Number of partitions of n having no parts with multiplicity 3.

Original entry on oeis.org

1, 1, 2, 2, 5, 6, 9, 12, 19, 24, 34, 43, 62, 77, 105, 132, 177, 220, 287, 356, 462, 570, 723, 888, 1121, 1370, 1705, 2074, 2570, 3111, 3816, 4601, 5617, 6743, 8170, 9777, 11794, 14058, 16858, 20029, 23932, 28334, 33692, 39772, 47133, 55468, 65471, 76840

Offset: 0

Emeric Deutsch, Apr 29 2006

nonn

Column 0 of A118806.

Infinite convolution product of [1,1,1,0,1,1,1,1,1,1] aerated n-1 times. I.e., [1,1,1,0,1,1,1,1,1,1] * [1,0,1,0,1,0,0,0,1,0] * [1,0,0,1,0,0,1,0,0,0] * ... - Mats Granvik, Gary W. Adamson, Aug 07 2009

			a(6) = 9 because among the 11 (=A000041(6)) partitions of 6 only [2,2,2] and [3,1,1,1] have parts with multiplicity 3.

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

Cf. A000041, A118806, A007690, A116645, A183560, A183568.

g:=product(1+x^j+x^(2*j)+x^(4*j)/(1-x^j),j=1..60): gser:=series(g,x=0,55): seq(coeff(gser,x,n),n=0..50);

nmax = 50; CoefficientList[Series[Product[(1 - x^(3*k) + x^(4*k))/(1-x^k), {k, 1, nmax}], {x, 0, nmax}], x] (* Vaclav Kotesovec, Mar 07 2016 *)

G.f.: Product_{j>=1} (1 + x^j + x^(2j) + x^(4j)/(1-x^j)).
a(n) = A000041(n) - A183560(n) = A183568(n,0) - A183568(n,3). - Alois P. Heinz, Oct 09 2011
a(n) ~ exp(sqrt((Pi^2/3 + 4*r)*n)) * sqrt(Pi^2/6 + 2*r) / (4*Pi*n), where r = Integral_{x=0..oo} log(1 + exp(-x) - exp(-3*x) + exp(-5*x)) dx = 0.73597677748514060768682570953508781551028221145343244320009... - Vaclav Kotesovec, Jun 12 2025

A183559 Number of partitions of n containing a clique of size 2.

Original entry on oeis.org

1, 0, 2, 2, 3, 5, 9, 10, 16, 23, 31, 43, 60, 75, 106, 140, 179, 237, 310, 389, 508, 647, 815, 1032, 1305, 1617, 2033, 2527, 3117, 3857, 4764, 5812, 7142, 8711, 10585, 12866, 15605, 18803, 22716, 27325, 32774, 39286, 47016, 56019, 66819, 79456, 94273, 111766

Offset: 2

Alois P. Heinz, Jan 05 2011

nonn

All parts of a number partition with the same value form a clique. The size of a clique is the number of elements in the clique.

			a(7) = 5, because 5 partitions of 7 contain (at least) one clique of size 2: [1,1,1,2,2], [1,1,2,3], [2,2,3], [1,3,3], [1,1,5].

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

Column k=2 of A183568.

Cf. A000041, A183558, A183560, A183561, A183562, A183563, A183564, A183565, A183566, A183567.

b:= proc(n, i) option remember; `if`(n=0, [1, 0], `if`(i<1, [0, 0],
      add((l->`if`(j=2, [l[1]$2], l))(b(n-i*j, i-1)), j=0..n/i)))
    end:
a:= n-> (l-> l[2])(b(n, n)):
seq(a(n), n=2..50);

max = 50; f = (1 - Product[1 - x^(2j) + x^(3j), {j, 1, max}])/Product[1 - x^j, {j, 1, max}]; s = Series[f, {x, 0, max}]; Drop[CoefficientList[s, x], 2] (* Jean-François Alcover, Oct 01 2014 *)

G.f.: (1-Product_{j>0} (1-x^(2*j)+x^(3*j))) / (Product_{j>0} (1-x^j)).

a(n) = A000041(n) - A116645(n). - Vaclav Kotesovec, Jun 12 2025

A184639 Number of partitions of n having no parts with multiplicity 4.

Original entry on oeis.org

1, 1, 2, 3, 4, 7, 10, 14, 19, 27, 37, 50, 67, 88, 115, 153, 196, 253, 324, 412, 524, 661, 828, 1036, 1290, 1603, 1980, 2443, 2997, 3671, 4487, 5460, 6631, 8034, 9703, 11703, 14075, 16890, 20226, 24175, 28838, 34332, 40801, 48394, 57307, 67765, 79974

Offset: 0

Alois P. Heinz, Jan 18 2011

nonn

			a(4) = 4, because 4 partitions of 4 have no parts with multiplicity 4: [1,1,2], [2,2], [1,3], [4].

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

Cf. A000041, A183561, A183568, A007690, A116645, A118807, A184640, A184641, A184642, A184643, A184644, A184645.

b:= proc(n, i) option remember; `if`(n=0, [1, 0], `if`(i<1, [0, 0],
      add((l->`if`(j=4, [l[1]$2], l))(b(n-i*j, i-1)), j=0..n/i)))
    end:
a:= n-> (l-> l[1]-l[2])(b(n, n)):
seq(a(n), n=0..50);

b[n_, i_] := b[n, i] = If[n == 0, {1, 0}, If[i<1, {0, 0}, Sum[Function[l, If[j == 4, {l[[1]], l[[1]]}, l]][b[n - i*j, i - 1]], {j, 0, n/i}]]];
a[n_] := b[n, n][[1]] - b[n, n][[2]];
Table[a[n], {n, 0, 50}] (* Jean-François Alcover, Apr 30 2018, after Alois P. Heinz *)

a(n) = A000041(n) - A183561(n).
a(n) = A183568(n,0) - A183568(n,4).
G.f.: Product_{j>0} (1-x^(4*j)+x^(5*j))/(1-x^j).
a(n) ~ exp(sqrt((Pi^2/3 + 4*r)*n)) * sqrt(Pi^2/6 + 2*r) / (4*Pi*n), where r = Integral_{x=0..oo} log(1 + exp(-x) - exp(-4*x) + exp(-6*x)) dx = 0.77101366877372033648945034346499691865027592089088481444183... - Vaclav Kotesovec, Jun 12 2025

A184640 Number of partitions of n having no parts with multiplicity 5.

Original entry on oeis.org

1, 1, 2, 3, 5, 6, 11, 14, 21, 28, 39, 51, 72, 92, 124, 160, 210, 266, 349, 438, 562, 704, 892, 1107, 1395, 1720, 2141, 2631, 3249, 3965, 4873, 5916, 7216, 8730, 10585, 12742, 15387, 18443, 22151, 26466, 31646, 37659, 44873, 53212, 63149, 74666, 88295

Offset: 0

Alois P. Heinz, Jan 18 2011

nonn

			a(5) = 6, because 6 partitions of 5 have no parts with multiplicity 5: [1,1,1,2], [1,2,2], [1,1,3], [2,3], [1,4], [5].

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

Cf. A000041, A183562, A183568, A007690, A116645, A118807, A184639, A184641, A184642, A184643, A184644, A184645.

b:= proc(n, i) option remember; `if`(n=0, [1, 0], `if`(i<1, [0, 0],
      add((l->`if`(j=5, [l[1]$2], l))(b(n-i*j, i-1)), j=0..n/i)))
    end:
a:= n-> (l-> l[1]-l[2])(b(n, n)):
seq(a(n), n=0..50);

b[n_, i_] := b[n, i] = If[n == 0, {1, 0}, If[i < 1, {0, 0}, Sum[Function[l, If[j == 5, {l[[1]], l[[1]]}, l]][b[n - i*j, i - 1]], {j, 0, n/i}]]];
a[n_] := b[n, n][[1]] - b[n, n][[2]];
Table[a[n], {n, 0, 50}] (* Jean-François Alcover, Apr 30 2018, after Alois P. Heinz *)

a(n) = A000041(n) - A183562(n).
a(n) = A183568(n,0) - A183568(n,5).
G.f.: Product_{j>0} (1-x^(5*j)+x^(6*j))/(1-x^j).
a(n) ~ exp(sqrt((Pi^2/3 + 4*r)*n)) * sqrt(Pi^2/6 + 2*r) / (4*Pi*n), where r = Integral_{x=0..oo} log(1 + exp(-x) - exp(-5*x) + exp(-7*x)) dx = 0.78834765570757713777493985857868631321765157344539753651545... - Vaclav Kotesovec, Jun 12 2025

A184641 Number of partitions of n having no parts with multiplicity 6.

Original entry on oeis.org

1, 1, 2, 3, 5, 7, 10, 15, 21, 29, 40, 54, 72, 96, 127, 166, 216, 279, 358, 457, 580, 735, 924, 1159, 1446, 1799, 2228, 2752, 3388, 4158, 5087, 6207, 7551, 9165, 11093, 13401, 16144, 19412, 23286, 27882, 33310, 39727, 47289, 56191, 66647, 78923, 93299

Offset: 0

Alois P. Heinz, Jan 18 2011

nonn

			a(6) = 10, because 10 partitions of 6 have no parts with multiplicity 6: [1,1,1,1,2], [1,1,2,2], [2,2,2], [1,1,1,3], [1,2,3], [3,3], [1,1,4], [2,4], [1,5], [6].

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

Cf. A000041, A183563, A183568, A007690, A116645, A118807, A184639, A184640, A184642, A184643, A184644, A184645.

b:= proc(n, i) option remember; `if`(n=0, [1, 0], `if`(i<1, [0, 0],
      add((l->`if`(j=6, [l[1]$2], l))(b(n-i*j, i-1)), j=0..n/i)))
    end:
a:= n-> (l-> l[1]-l[2])(b(n, n)):
seq(a(n), n=0..50);

b[n_, i_] := b[n, i] = If[n == 0, {1, 0}, If[i < 1, {0, 0}, Sum[Function[l, If[j == 6, {l[[1]], l[[1]]}, l]][b[n - i*j, i - 1]], {j, 0, n/i}]]];
a[n_] := b[n, n][[1]] - b[n, n][[2]];
Table[a[n], {n, 0, 50}] (* Jean-François Alcover, Apr 30 2018, after Alois P. Heinz *)

a(n) = A000041(n) - A183563(n).
a(n) = A183568(n,0) - A183568(n,6).
G.f.: Product_{j>0} (1-x^(6*j)+x^(7*j))/(1-x^j).
a(n) ~ exp(sqrt((Pi^2/3 + 4*r)*n)) * sqrt(Pi^2/6 + 2*r) / (4*Pi*n), where r = Integral_{x=0..oo} log(1 + exp(-x) - exp(-6*x) + exp(-8*x)) dx = 0.79818518024793359047735154473665146019665210453617381247423... - Vaclav Kotesovec, Jun 12 2025

A184642 Number of partitions of n having no parts with multiplicity 7.

Original entry on oeis.org

1, 1, 2, 3, 5, 7, 11, 14, 22, 29, 41, 54, 75, 97, 130, 168, 222, 283, 368, 465, 597, 750, 949, 1183, 1488, 1841, 2292, 2822, 3487, 4267, 5239, 6376, 7782, 9429, 11439, 13798, 16661, 20007, 24043, 28763, 34420, 41021, 48894, 58066, 68956, 81627, 96592

Offset: 0

Alois P. Heinz, Jan 18 2011

nonn

			a(7) = 14, because 14 partitions of 7 have no parts with multiplicity 7: [1,1,1,1,1,2], [1,1,1,2,2], [1,2,2,2], [1,1,1,1,3], [1,1,2,3], [2,2,3], [1,3,3], [1,1,1,4], [1,2,4], [3,4], [1,1,5], [2,5], [1,6], [7].

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

Cf. A000041, A183564, A183568, A007690, A116645, A118807, A184639, A184640, A184641, A184643, A184644, A184645.

b:= proc(n, i) option remember; `if`(n=0, [1, 0], `if`(i<1, [0, 0],
      add((l->`if`(j=7, [l[1]$2], l))(b(n-i*j, i-1)), j=0..n/i)))
    end:
a:= n-> (l-> l[1]-l[2])(b(n, n)):
seq(a(n), n=0..50);

b[n_, i_] := b[n, i] = If[n == 0, {1, 0}, If[i < 1, {0, 0}, Sum[Function[l, If[j == 7, {l[[1]], l[[1]]}, l]][b[n - i*j, i - 1]], {j, 0, n/i}]]];
a[n_] := b[n, n][[1]] - b[n, n][[2]];
Table[a[n], {n, 0, 50}] (* Jean-François Alcover, Apr 30 2018, after Alois P. Heinz *)
Table[Count[IntegerPartitions[n],?(FreeQ[Length/@Split[#],7]&)],{n,0,50}] (* _Harvey P. Dale, Sep 21 2024 *)

a(n) = A000041(n) - A183564(n).
a(n) = A183568(n,0) - A183568(n,7).
G.f.: Product_{j>0} (1-x^(7*j)+x^(8*j))/(1-x^j).
a(n) ~ exp(sqrt((Pi^2/3 + 4*r)*n)) * sqrt(Pi^2/6 + 2*r) / (4*Pi*n), where r = Integral_{x=0..oo} log(1 + exp(-x) - exp(-7*x) + exp(-9*x)) dx = 0.80430417180776436899064351977235191494130305607975798117531... - Vaclav Kotesovec, Jun 12 2025

A184643 Number of partitions of n having no parts with multiplicity 8.

Original entry on oeis.org

1, 1, 2, 3, 5, 7, 11, 15, 21, 30, 41, 55, 75, 99, 131, 172, 223, 288, 372, 474, 603, 764, 962, 1206, 1509, 1876, 2326, 2878, 3543, 4351, 5330, 6506, 7921, 9623, 11655, 14085, 16987, 20434, 24529, 29392, 35138, 41930, 49947, 59381, 70474, 83512, 98779

Offset: 0

Alois P. Heinz, Jan 18 2011

nonn

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

Cf. A000041, A183565, A183568, A007690, A116645, A118807, A184639, A184640, A184641, A184642, A184644, A184645.

b:= proc(n, i) option remember; `if`(n=0, [1, 0], `if`(i<1, [0, 0],
      add((l->`if`(j=8, [l[1]$2], l))(b(n-i*j, i-1)), j=0..n/i)))
    end:
a:= n-> (l-> l[1]-l[2])(b(n, n)):
seq(a(n), n=0..50);

b[n_, i_] := b[n, i] = If[n == 0, {1, 0}, If[i < 1, {0, 0}, Sum[Function[l, If[j == 8, {l[[1]], l[[1]]}, l]][b[n - i*j, i - 1]], {j, 0, n/i}]]];
a[n_] := b[n, n][[1]] - b[n, n][[2]];
Table[a[n], {n, 0, 50}] (* Jean-François Alcover, Apr 30 2018, after Alois P. Heinz *)

a(n) = A000041(n) - A183565(n).
a(n) = A183568(n,0) - A183568(n,8).
G.f.: Product_{j>0} (1-x^(8*j)+x^(9*j))/(1-x^j).
a(n) ~ exp(sqrt((Pi^2/3 + 4*r)*n)) * sqrt(Pi^2/6 + 2*r) / (4*Pi*n), where r = Integral_{x=0..oo} log(1 + exp(-x) - exp(-8*x) + exp(-10*x)) dx = 0.80836901097063952622501649557292291036896118821761722817375... - Vaclav Kotesovec, Jun 12 2025

A184644 Number of partitions of n having no parts with multiplicity 9.

Original entry on oeis.org

1, 1, 2, 3, 5, 7, 11, 15, 22, 29, 42, 55, 76, 99, 133, 172, 227, 290, 376, 477, 612, 769, 975, 1217, 1528, 1895, 2359, 2907, 3592, 4400, 5403, 6584, 8034, 9742, 11823, 14272, 17234, 20713, 24897, 29803, 35674, 42542, 50719, 60272, 71592, 84794

Offset: 0

Alois P. Heinz, Jan 18 2011

nonn

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

Cf. A000041, A183566, A183568, A007690, A116645, A118807, A184639, A184640, A184641, A184642, A184643, A184645.

b:= proc(n, i) option remember; `if`(n=0, [1, 0], `if`(i<1, [0, 0],
      add((l->`if`(j=9, [l[1]$2], l))(b(n-i*j, i-1)), j=0..n/i)))
    end:
a:= n-> (l-> l[1]-l[2])(b(n, n)):
seq(a(n), n=0..50);

b[n_, i_] := b[n, i] = If[n == 0, {1, 0}, If[i < 1, {0, 0}, Sum[Function[l, If[j == 9, {l[[1]], l[[1]]}, l]][b[n - i*j, i - 1]], {j, 0, n/i}]]];
a[n_] := b[n, n][[1]] - b[n, n][[2]];
Table[a[n], {n, 0, 50}] (* Jean-François Alcover, Apr 30 2018, after Alois P. Heinz *)

a(n) = A000041(n) - A183566(n).
a(n) = A183568(n,0) - A183568(n,9).
G.f.: Product_{j>0} (1-x^(9*j)+x^(10*j))/(1-x^j).
a(n) ~ exp(sqrt((Pi^2/3 + 4*r)*n)) * sqrt(Pi^2/6 + 2*r) / (4*Pi*n), where r = Integral_{x=0..oo} log(1 + exp(-x) - exp(-9*x) + exp(-11*x)) dx = 0.81120660452677002313966407107688916817839171627473737415672... - Vaclav Kotesovec, Jun 12 2025

cp's OEIS Frontend

A229816 Number of partitions of n such that if the length is k then k is not a part.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Formula

Extensions

A183568 Triangle T(n,k), n>=0, 0<=k<=n, read by rows: T(n,k) is the number of partitions of n containing a clique of size k.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

Formula

A118807 Number of partitions of n having no parts with multiplicity 3.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

Formula

A183559 Number of partitions of n containing a clique of size 2.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

Formula

A184639 Number of partitions of n having no parts with multiplicity 4.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Maple

Mathematica

Formula

A184640 Number of partitions of n having no parts with multiplicity 5.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Maple

Mathematica

Formula

A184641 Number of partitions of n having no parts with multiplicity 6.

Views

Author

Keywords

Examples

Links

Crossrefs