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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A326688 Sum of the 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, 3, 3, 8, 8, 15, 20, 20, 27, 43, 50, 67, 83, 85, 116, 144, 164, 202, 253, 254, 341, 385, 448, 485, 600, 609, 779, 827, 957, 1017, 1281, 1230, 1586, 1584, 1890, 1944, 2411, 2301, 2956, 2840, 3483 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,21

LINKS

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

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)} 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) * (n-i-j-k-l-m-o-p-q-r), where c = A010051.

a(n) = A326678(n) - A326679(n) - A326680(n) - A326681(n) - A326682(n) - A326683(n) - A326684(n) - A326685(n) - A326686(n) - A326687(n).

MATHEMATICA

Table[Sum[Sum[Sum[Sum[Sum[Sum[Sum[Sum[Sum[(n-i-j-k-l-m-o-p-q-r) * (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}]

CROSSREFS

Cf. A010051, A259201, A326678, A326679, A326680, A326681, A326682, A326683, A326684, A326685, A326686, A326687.

Sequence in context: A308980 A326463 A326549 * A011155 A161136 A258163

Adjacent sequences:  A326685 A326686 A326687 * A326689 A326690 A326691

KEYWORD

nonn

AUTHOR

Wesley Ivan Hurt, Jul 17 2019

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 22 09:50 EDT 2022. Contains 353949 sequences. (Running on oeis4.)