A238340 -id:A238340 - cp's OEIS frontend

A308872 Sum of the second largest parts in the partitions of n into 6 parts.

0, 0, 0, 0, 0, 0, 1, 1, 3, 5, 10, 15, 27, 37, 59, 82, 120, 160, 227, 293, 396, 508, 664, 832, 1068, 1314, 1650, 2012, 2477, 2980, 3628, 4314, 5178, 6111, 7250, 8477, 9975, 11566, 13483, 15543, 17970, 20577, 23646, 26907, 30712, 34785, 39469, 44472, 50217

Offset: 0

Wesley Ivan Hurt, Jun 29 2019

nonn

Index entries for sequences related to partitions

Cf. A238340, A308867, A308868, A308869, A306670, A306671, A308873.

Table[Sum[Sum[Sum[Sum[Sum[i, {i, j, Floor[(n - j - k - l - m)/2]}], {j, k, Floor[(n - k - l - m)/3]}], {k, l, Floor[(n - l - m)/4]}], {l, m, Floor[(n - m)/5]}], {m, Floor[n/6]}], {n, 0, 50}]

a(n) = Sum_{m=1..floor(n/6)} Sum_{l=m..floor((n-m)/5)} Sum_{k=l..floor((n-l-m)/4)} Sum_{j=k..floor((n-k-l-m)/3)} Sum_{i=j..floor((n-j-k-l-m)/2)} i.

a(n) = A308867(n) - A308868(n) - A308869(n) - A306670(n) - A306671(n) - A308873(n).

A308873 Sum of the largest parts in the partitions of n into 6 parts.

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 1, 2, 5, 9, 17, 27, 46, 67, 103, 146, 210, 285, 396, 520, 694, 896, 1162, 1466, 1865, 2310, 2881, 3525, 4321, 5215, 6317, 7535, 9011, 10653, 12603, 14761, 17316, 20113, 23390, 26990, 31146, 35698, 40939, 46632, 53139, 60221, 68236, 76931

Offset: 0

Wesley Ivan Hurt, Jun 29 2019

nonn

Index entries for sequences related to partitions

Cf. A238340, A308867, A308868, A308869, A306670, A306671, A308872.

Table[Sum[Sum[Sum[Sum[Sum[(n - i - j - k - l - m), {i, j, Floor[(n - j - k - l - m)/2]}], {j, k, Floor[(n - k - l - m)/3]}], {k, l, Floor[(n - l - m)/4]}], {l, m, Floor[(n - m)/5]}], {m, Floor[n/6]}], {n, 0, 50}]

a(n) = Sum_{m=1..floor(n/6)} Sum_{l=m..floor((n-m)/5)} Sum_{k=l..floor((n-l-m)/4)} Sum_{j=k..floor((n-k-l-m)/3)} Sum_{i=j..floor((n-j-k-l-m)/2)} (n-i-j-k-l-m).

a(n) = A308867(n) - A308868(n) - A308869(n) - A306670(n) - A306671(n) - A308872(n).

A256225 Number of partitions of 5n into 5 parts.

Original entry on oeis.org

0, 1, 7, 30, 84, 192, 377, 674, 1115, 1747, 2611, 3765, 5260, 7166, 9542, 12470, 16019, 20282, 25337, 31289, 38225, 46262, 55496, 66055, 78045, 91606, 106852, 123935, 142979, 164147, 187572, 213429, 241860, 273052, 307156, 344370, 384855, 428821, 476437, 527925

Offset: 0

Colin Barker, Mar 19 2015

			For n=2, the 7 partitions of 10 are [6,1,1,1,1], [5,2,1,1,1], [4,3,1,1,1], [4,2,2,1,1], [3,3,2,1,1], [3,2,2,2,1] and [2,2,2,2,2].

Colin Barker, Table of n, a(n) for n = 0..1000
Index entries for linear recurrences with constant coefficients, signature (2,0,-1,0,-2,2,0,1,0,-2,1).

Cf. A001401, A077043, A238340, A256226, A256235.

Length /@ (Length /@ IntegerPartitions[5 #, {5}] & /@ Range@ 39) (* Michael De Vlieger, Mar 20 2015 *)

concat(0, Vec(-x* (x^8+5*x^7+16*x^6+25*x^5+31*x^4+25*x^3+16*x^2+5*x+1) / ((x-1)^5*(x+1)^2*(x^2+1)*(x^2+x+1)) + O(x^100)))

concat(0, vector(40, n, k=0; forpart(p=5*n, k++, , [5,5]); k)) \\ Colin Barker, Mar 21 2015

G.f.: -x*(x^8+5*x^7+16*x^6+25*x^5+31*x^4+25*x^3+16*x^2+5*x+1) / ((x-1)^5*(x+1)^2*(x^2+1)*(x^2+x+1)).

A239186 Sum of the largest two parts in the partitions of 4n into 4 parts with smallest part equal to 1.

Original entry on oeis.org

2, 23, 93, 243, 492, 878, 1432, 2165, 3123, 4337, 5810, 7596, 9726, 12195, 15065, 18367, 22088, 26298, 31028, 36257, 42063, 48477, 55470, 63128, 71482, 80495, 90261, 100811, 112100, 124230, 137232, 151053, 165803, 181513, 198122, 215748, 234422, 254075

Offset: 1

Wesley Ivan Hurt, Mar 11 2014

			For a(n) add the numbers in the first two columns.
                                              13 + 1 + 1 + 1
                                              12 + 2 + 1 + 1
                                              11 + 3 + 1 + 1
                                              10 + 4 + 1 + 1
                                               9 + 5 + 1 + 1
                                               8 + 6 + 1 + 1
                                               7 + 7 + 1 + 1
                                              11 + 2 + 2 + 1
                                              10 + 3 + 2 + 1
                              9 + 1 + 1 + 1    9 + 4 + 2 + 1
                              8 + 2 + 1 + 1    8 + 5 + 2 + 1
                              7 + 3 + 1 + 1    7 + 6 + 2 + 1
                              6 + 4 + 1 + 1    9 + 3 + 3 + 1
                              5 + 5 + 1 + 1    8 + 4 + 3 + 1
                              7 + 2 + 2 + 1    7 + 5 + 3 + 1
               5 + 1 + 1 + 1  6 + 3 + 2 + 1    6 + 6 + 3 + 1
               4 + 2 + 1 + 1  5 + 4 + 2 + 1    7 + 4 + 4 + 1
               3 + 3 + 1 + 1  5 + 3 + 3 + 1    6 + 5 + 4 + 1
1 + 1 + 1 + 1  3 + 2 + 2 + 1  4 + 4 + 3 + 1    5 + 5 + 5 + 1
    4(1)            4(2)           4(3)            4(4)       ..   4n
------------------------------------------------------------------------
     2               23             93             243        ..   a(n)

Vincenzo Librandi, Table of n, a(n) for n = 1..1000
Index entries for sequences related to partitions
Index entries for linear recurrences with constant coefficients, signature (2,-1,2,-4,2,-1,2,-1).

Cf. A238328, A238340, A238702, A238705, A238706, A239056, A239057, A239059.

b[n_] := Sum[((4 n - 2 - i)*Floor[(4 n - 2 - i)/2] - i (4 n - 2 - i)) (Floor[(Sign[(Floor[(4 n - 2 - i)/2] - i)] + 2)/2]), {i, 0, 2 n}]; Table[b[n], {n, 50}]

Vec(x*(10*x^6+39*x^5+61*x^4+76*x^3+49*x^2+19*x+2)/((x-1)^4*(x^2+x+1)^2) + O(x^100)) \\ Colin Barker, Sep 22 2014

G.f.: x*(10*x^6+39*x^5+61*x^4+76*x^3+49*x^2+19*x+2) / ((x-1)^4*(x^2+x+1)^2). - Colin Barker, Mar 12 2014

a(n) = 2*a(n-1)-a(n-2)+2*a(n-3)-4*a(n-4)+2*a(n-5)-a(n-6)+2*a(n-7)-a(n-8). - Wesley Ivan Hurt, Nov 19 2021

A256226 Number of partitions of 6n into 6 parts.

Original entry on oeis.org

0, 1, 11, 58, 199, 532, 1206, 2432, 4494, 7760, 12692, 19858, 29941, 43752, 62239, 86499, 117788, 157532, 207338, 269005, 344534, 436140, 546261, 677571, 832989, 1015691, 1229120, 1476997, 1763332, 2092435, 2468926, 2897747, 3384171, 3933815, 4552649, 5247008

Offset: 0

Colin Barker, Mar 19 2015

			For n=2, the 11 partitions of 12 are Xs = [7,1,1,1,1,1], [6,2,1,1,1,1], [5,3,1,1,1,1], [4,4,1,1,1,1], [5,2,2,1,1,1], [4,3,2,1,1,1], [3,3,3,1,1,1], [4,2,2,2,1,1], [3,3,2,2,1,1], [3,2,2,2,2,1] and [2,2,2,2,2,2].

Colin Barker, Table of n, a(n) for n = 0..1000
Index entries for linear recurrences with constant coefficients, signature (4,-5,0,5,-3,-3,5,0,-5,4,-1).

Cf. A001402, A077043, A238340, A256225.

CoefficientList[Series[x (3 x^7 + 14 x^6 + 21 x^5 + 21 x^4 + 22 x^3 + 19 x^2 + 7 x + 1) / ((x - 1)^6 (x + 1) (x^4 + x^3 + x^2 + x + 1)), {x, 0, 40}], x] (* Vincenzo Librandi, Mar 20 2015 *)

concat(0, Vec(x*(3*x^7+14*x^6+21*x^5+21*x^4+22*x^3+19*x^2+7*x+1)/((x-1)^6*(x+1)*(x^4+x^3+x^2+x+1)) + O(x^100)))

concat(0, vector(35, n, k=0; forpart(p=6*n, k++, , [6,6]); k)) \\ Colin Barker, Mar 21 2015

G.f.: x*(3*x^7+14*x^6+21*x^5+21*x^4+22*x^3+19*x^2+7*x+1) / ((x-1)^6*(x+1)*(x^4+x^3+x^2+x+1)).

A239667 Sum of the largest parts of the partitions of 4n into 4 parts.

Original entry on oeis.org

1, 17, 84, 262, 629, 1289, 2370, 4014, 6393, 9703, 14150, 19974, 27439, 36815, 48410, 62556, 79587, 99879, 123832, 151844, 184359, 221845, 264764, 313628, 368973, 431325, 501264, 579394, 666305, 762645, 869086, 986282, 1114949, 1255827, 1409634, 1577154, 1759195, 1956539, 2170038, 2400568

Offset: 1

Wesley Ivan Hurt and Antonio Osorio, Mar 23 2014

			Add the numbers in the first column for a(n):
                                             13 + 1 + 1 + 1
                                             12 + 2 + 1 + 1
                                             11 + 3 + 1 + 1
                                             10 + 4 + 1 + 1
                                              9 + 5 + 1 + 1
                                              8 + 6 + 1 + 1
                                              7 + 7 + 1 + 1
                                             11 + 2 + 2 + 1
                                             10 + 3 + 2 + 1
                                              9 + 4 + 2 + 1
                                              8 + 5 + 2 + 1
                                              7 + 6 + 2 + 1
                                              9 + 3 + 3 + 1
                                              8 + 4 + 3 + 1
                                              7 + 5 + 3 + 1
                                              6 + 6 + 3 + 1
                                              7 + 4 + 4 + 1
                                              6 + 5 + 4 + 1
                                              5 + 5 + 5 + 1
                              9 + 1 + 1 + 1  10 + 2 + 2 + 2
                              8 + 2 + 1 + 1   9 + 3 + 2 + 2
                              7 + 3 + 1 + 1   8 + 4 + 2 + 2
                              6 + 4 + 1 + 1   7 + 5 + 2 + 2
                              5 + 5 + 1 + 1   6 + 6 + 2 + 2
                              7 + 2 + 2 + 1   8 + 3 + 3 + 2
                              6 + 3 + 2 + 1   7 + 4 + 3 + 2
                              5 + 4 + 2 + 1   6 + 5 + 3 + 2
                              5 + 3 + 3 + 1   6 + 4 + 4 + 2
                              4 + 4 + 3 + 1   5 + 5 + 4 + 2
               5 + 1 + 1 + 1  6 + 2 + 2 + 2   7 + 3 + 3 + 3
               4 + 2 + 1 + 1  5 + 3 + 2 + 2   6 + 4 + 3 + 3
               3 + 3 + 1 + 1  4 + 4 + 2 + 2   5 + 5 + 3 + 3
               3 + 2 + 2 + 1  4 + 3 + 3 + 2   5 + 4 + 4 + 3
1 + 1 + 1 + 1  2 + 2 + 2 + 2  3 + 3 + 3 + 3   4 + 4 + 4 + 4
    4(1)            4(2)           4(3)            4(4)       ..   4n
------------------------------------------------------------------------
     1               17             84             262        ..   a(n)

A. Osorio, A Sequential Allocation Problem: The Asymptotic Distribution of Resources, Munich Personal RePEc Archive, 2014.
Index entries for sequences related to partitions
Index entries for linear recurrences with constant coefficients, signature (3,-3,3,-6,6,-3,3,-3,1).

Cf. A238328, A238340, A238702, A238705, A238706, A239056, A239057, A239059, A239186.

I:=[1,17,84,262,629,1289,2370,4014,6393]; [n le 9 select I[n] else 3*Self(n-1)-3*Self(n-2)+3*Self(n-3)-6*Self(n-4)+6*Self(n-5)-3*Self(n-6)+3*Self(n-7)-3*Self(n-8)+Self(n-9): n in [1..45]]; // Vincenzo Librandi, Aug 29 2015

CoefficientList[Series[-(9*x^6 + 32*x^5 + 50*x^4 + 58*x^3 + 36*x^2 + 14*x +
1)/((x - 1)^5*(x^2 + x + 1)^2), {x, 0, 50}], x] (* Wesley Ivan Hurt, Jun 13 2014 *)
LinearRecurrence[{3, -3, 3, -6, 6, -3, 3, -3, 1}, {1, 17, 84, 262, 629, 1289, 2370, 4014, 6393}, 50](* Vincenzo Librandi, Aug 29 2015 *)
Table[Total[IntegerPartitions[4 n,{4}][[All,1]]],{n,40}] (* Harvey P. Dale, Apr 25 2020 *)

Vec(-x*(9*x^6+32*x^5+50*x^4+58*x^3+36*x^2+14*x+1) / ((x-1)^5*(x^2+x+1)^2) + O(x^100)) \\ Colin Barker, Mar 23 2014

G.f.: -x*(9*x^6+32*x^5+50*x^4+58*x^3+36*x^2+14*x+1) / ((x-1)^5*(x^2+x+1)^2). - Colin Barker, Mar 23 2014

Let b(1) = 4, with b(n) = (n/(n-1)) * b(n-1) + 4n * Sum_{i=0..2n} (floor((4n-2-i)/2)-i) * floor((sign(floor((4n-2-i)/2)-i)+2)/2). Then a(1) = 1, with a(n) = a(n-1) + b(n-1)/(4n-4) + Sum_{i=j+1..floor((4n-2-j)/2)} ( Sum_{j=0..2n} (4n-2-i-j) * floor((sign(floor((4n-2-j)/2)-j)+2)/2) ). - Wesley Ivan Hurt, Jun 13 2014

A240707 Sum of the middle parts in the partitions of 4n-1 into 3 parts.

Original entry on oeis.org

1, 8, 31, 80, 159, 282, 459, 690, 993, 1378, 1841, 2404, 3077, 3852, 4755, 5796, 6963, 8286, 9775, 11414, 13237, 15254, 17445, 19848, 22473, 25296, 28359, 31672, 35207, 39010, 43091, 47418, 52041, 56970, 62169, 67692, 73549, 79700, 86203, 93068, 100251

Offset: 1

Wesley Ivan Hurt, Apr 10 2014

Original definition: Sum of the second largest parts in the partitions of 4n into 4 parts with smallest part = 1 (see the example).

			For a(n) add the parts in the second columns.
                                              13 + 1 + 1 + 1
                                              12 + 2 + 1 + 1
                                              11 + 3 + 1 + 1
                                              10 + 4 + 1 + 1
                                               9 + 5 + 1 + 1
                                               8 + 6 + 1 + 1
                                               7 + 7 + 1 + 1
                                              11 + 2 + 2 + 1
                                              10 + 3 + 2 + 1
                              9 + 1 + 1 + 1    9 + 4 + 2 + 1
                              8 + 2 + 1 + 1    8 + 5 + 2 + 1
                              7 + 3 + 1 + 1    7 + 6 + 2 + 1
                              6 + 4 + 1 + 1    9 + 3 + 3 + 1
                              5 + 5 + 1 + 1    8 + 4 + 3 + 1
                              7 + 2 + 2 + 1    7 + 5 + 3 + 1
               5 + 1 + 1 + 1  6 + 3 + 2 + 1    6 + 6 + 3 + 1
               4 + 2 + 1 + 1  5 + 4 + 2 + 1    7 + 4 + 4 + 1
               3 + 3 + 1 + 1  5 + 3 + 3 + 1    6 + 5 + 4 + 1
1 + 1 + 1 + 1  3 + 2 + 2 + 1  4 + 4 + 3 + 1    5 + 5 + 5 + 1
    4(1)            4(2)           4(3)            4(4)       ..   4n
------------------------------------------------------------------------
     1               8              31              80        ..   a(n)

Index entries for sequences related to partitions
Index entries for linear recurrences with constant coefficients, signature (2,-1,2,-4,2,-1,2,-1).

Cf. A238328, A238340, A238702, A238705, A238706, A239056, A239057, A239059.

A240707:=n->add(add(i*floor((signum((floor((4*n-2-j)/2)-j))+2)/2), i=j+1..floor((4*n-2-j)/2)), j=0..2*n); seq(A240707(n), n=1..50);

c[n_] := Sum[Sum[i (Floor[(Sign[(Floor[(4 n - 2 - j)/2] - j)] + 2)/2]), {i, j + 1, Floor[(4 n - 2 - j)/2]}], {j, 0, 2 n}]; Table[c[n], {n, 50}]

Vec(x*(x^2+3*x+1)*(3*x^4+3*x^3+6*x^2+3*x+1)/((x-1)^4*(x^2+x+1)^2) + O(x^100)) \\ Colin Barker, Apr 13 2014

A240707(n)=sum(a=1,(4*n-1)\3,(4*n-1-a)\2*((4*n-1-a)\2+1)-a*(a-1))\2 \\ The summand is sum(b=a,(4*n-1-a)\2,b). - M. F. Hasler, Apr 17 2014

G.f.: x*(x^2+3*x+1)*(3*x^4+3*x^3+6*x^2+3*x+1) / ((x-1)^4*(x^2+x+1)^2). - Colin Barker, Apr 13 2014

Definition simplified by M. F. Hasler, Apr 17 2014

A241084 Sum of the second largest parts of the partitions of 4n into 4 parts.

Original entry on oeis.org

1, 10, 46, 141, 334, 680, 1247, 2106, 3348, 5077, 7396, 10432, 14325, 19210, 25250, 32621, 41490, 52056, 64531, 79114, 96040, 115557, 137896, 163328, 192137, 224586, 260982, 301645, 346870, 397000, 452391, 513370, 580316, 653621, 733644, 820800, 915517, 1018186, 1129258, 1249197

Offset: 1

Wesley Ivan Hurt and Antonio Osorio, Apr 15 2014

			For a(n) add the numbers in the second columns.
                                             13 + 1 + 1 + 1
                                             12 + 2 + 1 + 1
                                             11 + 3 + 1 + 1
                                             10 + 4 + 1 + 1
                                              9 + 5 + 1 + 1
                                              8 + 6 + 1 + 1
                                              7 + 7 + 1 + 1
                                             11 + 2 + 2 + 1
                                             10 + 3 + 2 + 1
                                              9 + 4 + 2 + 1
                                              8 + 5 + 2 + 1
                                              7 + 6 + 2 + 1
                                              9 + 3 + 3 + 1
                                              8 + 4 + 3 + 1
                                              7 + 5 + 3 + 1
                                              6 + 6 + 3 + 1
                                              7 + 4 + 4 + 1
                                              6 + 5 + 4 + 1
                                              5 + 5 + 5 + 1
                              9 + 1 + 1 + 1  10 + 2 + 2 + 2
                              8 + 2 + 1 + 1   9 + 3 + 2 + 2
                              7 + 3 + 1 + 1   8 + 4 + 2 + 2
                              6 + 4 + 1 + 1   7 + 5 + 2 + 2
                              5 + 5 + 1 + 1   6 + 6 + 2 + 2
                              7 + 2 + 2 + 1   8 + 3 + 3 + 2
                              6 + 3 + 2 + 1   7 + 4 + 3 + 2
                              5 + 4 + 2 + 1   6 + 5 + 3 + 2
                              5 + 3 + 3 + 1   6 + 4 + 4 + 2
                              4 + 4 + 3 + 1   5 + 5 + 4 + 2
               5 + 1 + 1 + 1  6 + 2 + 2 + 2   7 + 3 + 3 + 3
               4 + 2 + 1 + 1  5 + 3 + 2 + 2   6 + 4 + 3 + 3
               3 + 3 + 1 + 1  4 + 4 + 2 + 2   5 + 5 + 3 + 3
               3 + 2 + 2 + 1  4 + 3 + 3 + 2   5 + 4 + 4 + 3
1 + 1 + 1 + 1  2 + 2 + 2 + 2  3 + 3 + 3 + 3   4 + 4 + 4 + 4
    4(1)            4(2)           4(3)            4(4)       ..   4n
------------------------------------------------------------------------
     1               10             46             141        ..   a(n)

A. Osorio, A Sequential Allocation Problem: The Asymptotic Distribution of Resources, Munich Personal RePEc Archive, 2014.
Index entries for sequences related to partitions
Index entries for linear recurrences with constant coefficients, signature (3,-3,3,-6,6,-3,3,-3,1).

Cf. A238328, A238340, A238702, A238705, A238706, A239056, A239057, A239059.

I:=[1,10,46,141,334,680,1247,2106,3348]; [n le 9 select I[n] else 3*Self(n-1)-3*Self(n-2)+3*Self(n-3)-6*Self(n-4)+6*Self(n-5)-3*Self(n-6)+3*Self(n-7)-3*Self(n-8)+Self(n-9): n in [1..45]]; // Vincenzo Librandi, Aug 29 2015

CoefficientList[Series[-(5*x^6 + 17*x^5 + 25*x^4 + 30*x^3 + 19*x^2 + 7*x + 1)/((x - 1)^5*(x^2 + x + 1)^2), {x, 0, 50}], x] (* Wesley Ivan Hurt, Jun 13 2014 *)
LinearRecurrence[{3, -3, 3, -6, 6, -3, 3, -3, 1}, {1, 10, 46, 141, 334, 680, 1247, 2106, 3348}, 50] (* Vincenzo Librandi, Aug 29 2015 *)
Table[Total[IntegerPartitions[4 n,{4}][[;;,2]]],{n,40}] (* Harvey P. Dale, Aug 17 2024 *)

Vec(-x*(5*x^6+17*x^5+25*x^4+30*x^3+19*x^2+7*x+1)/((x-1)^5*(x^2+x+1)^2) + O(x^100)) \\ Colin Barker, Apr 16 2014

G.f.: -x*(5*x^6+17*x^5+25*x^4+30*x^3+19*x^2+7*x+1) / ((x-1)^5*(x^2+x+1)^2). - Colin Barker, Apr 16 2014

Recurrence: Let b(1) = 4, with b(n) = (n/(n-1)) * b(n-1) + 4n*Sum_{i=0..2n} (floor((4n-2-i)/2)-i) * (floor((sign((floor((4n-2-i)/2)-i))+2)/2)) for n>1. Then a(1) = 1, with a(n) = a(n-1) + b(n-1)/(4n-4) + Sum_{j=0..2n} (Sum_{i=j+1..floor((4n-2-j)/2)} i * (floor((sign((floor((4n-2-j)/2)-j))+ 2)/2)) ), for n>1. - Wesley Ivan Hurt, Jun 27 2014

A256287 Number of partitions of 7n into 7 parts.

Original entry on oeis.org

0, 1, 15, 105, 436, 1367, 3539, 8033, 16475, 31275, 55748, 94425, 153192, 239691, 363446, 536375, 772909, 1090592, 1510201, 2056462, 2758123, 3648814, 4767088, 6157387, 7870067, 9962502, 12499033, 15552247, 19202869, 23541165, 28666799, 34690401, 41733315

Offset: 0

Colin Barker, Mar 21 2015

			For n=2, the 15 partitions of 14 are [1,1,1,1,1,1,8], [1,1,1,1,1,2,7], ..., [1,2,2,2,2,2,3], [2,2,2,2,2,2,2].

Ray Chandler, Table of n, a(n) for n = 0..50
Index entries for linear recurrences with constant coefficients, signature (2, 0, -1, 0, -1, 1, -2, 2, 1, 0, 0, 0, -1, -2, 2, -1, 1, 0, 1, 0, -2, 1).

Cf. A235988, A238340, A256225, A256226, A256288.

Length /@ (Total /@ IntegerPartitions[7 #, {7}] & /@ Range[0, 24]) (* Michael De Vlieger, Mar 21 2015 *)

concat(0, vector(35, n, k=0; forpart(p=7*n, k++, , [7,7]); k))

A256316 Number of partitions of 4n into exactly 5 parts.

Original entry on oeis.org

0, 0, 3, 13, 37, 84, 164, 291, 480, 748, 1115, 1602, 2233, 3034, 4033, 5260, 6747, 8529, 10642, 13125, 16019, 19366, 23212, 27604, 32591, 38225, 44559, 51649, 59553, 68331, 78045, 88759, 100540, 113456, 127578, 142979, 159733, 177918, 197613, 218899, 241860

Offset: 0

Colin Barker, Mar 23 2015

			For n=2 the 3 partitions of 4*2 = 8 are [1,1,1,1,4], [1,1,1,2,3] and [1,1,2,2,2].

Colin Barker, Table of n, a(n) for n = 0..1000
Index entries for linear recurrences with constant coefficients, signature (3,-3,2,-3,4,-4,3,-2,3,-3,1).

Cf. A238340 (4 parts), A256317 (6 parts).

concat(0, vector(40, n, k=0; forpart(p=4*n, k++, , [5,5]); k))

concat([0,0], Vec(-x^2*(2*x^6+4*x^5+6*x^4+6*x^3+7*x^2+4*x+3)/((x-1)^5*(x^2+x+1)*(x^4+x^3+x^2+x+1)) + O(x^100)))

G.f.: -x^2*(2*x^6+4*x^5+6*x^4+6*x^3+7*x^2+4*x+3) / ((x-1)^5*(x^2+x+1)*(x^4+x^3+x^2+x+1)).

a(n) = 3*a(n-1) - 3*a(n-2) + 2*a(n-3) - 3*a(n-4) + 4*a(n-5) - 4*a(n-6) + 3*a(n-7) - 2*a(n-8) + 3*a(n-9) - 3*a(n-10) + a(n-11). - Wesley Ivan Hurt, Jun 26 2025

cp's OEIS Frontend

A308872 Sum of the second largest parts in the partitions of n into 6 parts.

Views

Author

Keywords

Links

Crossrefs

Programs

Mathematica

Formula

A308873 Sum of the largest parts in the partitions of n into 6 parts.

Views

Author

Keywords

Links

Crossrefs

Programs

Mathematica

Formula

A256225 Number of partitions of 5n into 5 parts.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Mathematica

PARI

PARI

Formula

A239186 Sum of the largest two parts in the partitions of 4n into 4 parts with smallest part equal to 1.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A256226 Number of partitions of 6n into 6 parts.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Mathematica

PARI

PARI

Formula

A239667 Sum of the largest parts of the partitions of 4n into 4 parts.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Magma

Mathematica

PARI

Formula

A240707 Sum of the middle parts in the partitions of 4n-1 into 3 parts.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

PARI

PARI

Formula