[go: up one dir, main page]

login
A326681
Sum of the eighth largest parts of the partitions of n into 10 primes.
10
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 2, 2, 4, 4, 6, 8, 8, 11, 15, 18, 19, 25, 24, 32, 34, 42, 44, 59, 53, 74, 73, 92, 87, 120, 109, 150, 138, 180, 163, 229, 190, 273, 238, 321, 277, 395, 325, 472, 387, 548, 457, 657, 515, 768, 617
OFFSET
0,21
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)} c(r) * c(q) * c(p) * c(o) * c(m) * c(l) * c(k) * c(j) * c(i) * c(n-i-j-k-l-m-o-p-q-r) * p, where c = A010051.
a(n) = A326678(n) - A326679(n) - A326680(n) - A326682(n) - A326683(n) - A326684(n) - A326685(n) - A326686(n) - A326687(n) - A326688(n).
MATHEMATICA
Table[Sum[Sum[Sum[Sum[Sum[Sum[Sum[Sum[Sum[p * (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[q] - PrimePi[q - 1]) (PrimePi[r] - PrimePi[r - 1]) (PrimePi[n - i - j - k - l - m - o - p - q - r] - PrimePi[n - i - j - k - l - m - o - p - q - r - 1]), {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}]
KEYWORD
nonn
AUTHOR
Wesley Ivan Hurt, Jul 17 2019
STATUS
approved