A326591 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

A326591

Sum of the eighth largest parts of the partitions of n into 10 parts.

0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 2, 3, 5, 7, 11, 15, 23, 32, 46, 61, 85, 112, 151, 197, 261, 335, 437, 554, 710, 891, 1125, 1398, 1747, 2151, 2657, 3246, 3972, 4812, 5840, 7023, 8455, 10104, 12076, 14339, 17029, 20102, 23724, 27857, 32694, 38190, 44588

(list; graph; refs; listen; history; text; internal format)

OFFSET

0,13

LINKS

Table of n, a(n) for n=0..52.

Index entries for sequences related to partitions

FORMULA

a(n) = Sum_{r=1..floor(n/10)} Sum_{q=r..floor((n-r)/9)} Sum_{p=q..floor((n-q-r)/8)} Sum_{o=p..floor((n-p-q-r)/7)} Sum_{m=o..floor((n-o-p-q-r)/6)} Sum_{l=m..floor((n-m-o-p-q-r)/5)} Sum_{k=l..floor((n-l-m-o-p-q-r)/4)} Sum_{j=k..floor((n-k-l-m-o-p-q-r)/3)} Sum_{i=j..floor((n-j-k-l-m-o-p-q-r)/2)} p.

a(n) = A326588(n) - A326589(n) - A326590(n) - A326592(n) - A326593(n) - A326594(n) - A326595(n) - A326596(n) - A326597(n) - A326598(n).

MATHEMATICA

Table[Sum[Sum[Sum[Sum[Sum[Sum[Sum[Sum[Sum[p, {i, j, Floor[(n - j - k - l - m - o - p - q - r)/2]}], {j, k, Floor[(n - k - l - m - o - p - q - r)/3]}], {k, l, Floor[(n - l - m - o - p - q - r)/4]}], {l, m, Floor[(n - m - o - p - q - r)/5]}], {m, o, Floor[(n - o - p - q - r)/6]}], {o, p, Floor[(n - p - q - r)/7]}], {p, q, Floor[(n - q - r)/8]}], {q, r, Floor[(n - r)/9]}], {r, Floor[n/10]}], {n, 0, 50}]

CROSSREFS

Cf. A026816, A326588, A326589, A326590, A326592, A326593, A326594, A326595, A326596, A326597, A326598.

Sequence in context: A055771 A052955 A326466 * A177485 A218023 A165801

Adjacent sequences: A326588 A326589 A326590 * A326592 A326593 A326594

KEYWORD

nonn

AUTHOR

Wesley Ivan Hurt, Jul 13 2019

STATUS

approved