A326458 Sum of the sixth largest parts of the partitions of n into 8 primes.

0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 2, 2, 4, 4, 6, 9, 9, 12, 13, 17, 18, 24, 20, 30, 32, 41, 37, 56, 47, 71, 65, 88, 76, 114, 88, 138, 115, 162, 129, 205, 157, 246, 187, 282, 225, 352, 247, 404, 298, 469, 339, 553, 385, 641, 453, 731, 522, 855

Offset

0,17

Links

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

Index entries for sequences related to partitions

Formula

a(n) = Sum_{p=1..floor(n/8)} Sum_{o=p..floor((n-p)/7)} Sum_{m=o..floor((n-o-p)/6)} Sum_{l=m..floor((n-m-o-p)/5)} Sum_{k=l..floor((n-l-m-o-p)/4)} Sum_{j=k..floor((n-k-l-m-o-p)/3)} Sum_{i=j..floor((n-j-k-l-m-o-p)/2)} c(p) * c(o) * c(m) * c(l) * c(k) * c(j) * c(i) * c(n-i-j-k-l-m-o-p) * m, where c = A010051.

a(n) = A326455(n) - A326456(n) - A326457(n) - A326459(n) - A326460(n) - A326461(n) - A326462(n) - A326463(n).

Mathematica

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

Crossrefs

Cf. A010051, A259198, A326455, A326456, A326457, A326459, A326460, A326461, A326462, A326463.

Sequence in context: A132325 A308920 A308976 * A326544 A326683 A239961

Adjacent sequences: A326455 A326456 A326457 * A326459 A326460 A326461

Keyword

nonn

Author

Wesley Ivan Hurt, Jul 06 2019

Status

approved